From randomizing polynomials to parallel algorithms

Keyphrases

• Algorithm Design 33%
• Arbitrary Field 33%
• Class Function 33%
• Computable Function 33%
• Constant Degree 100%
• Constant Rounds 33%
• Counting Algorithm 33%
• Cryptography 100%
• Efficient Representation 33%
• Finite Fields 33%
• Limited Power 33%
• Log-space 33%
• Monomial 33%
• Multi-party Protocol 33%
• Multivariate Polynomials 33%
• Oracle 33%
• Output Distribution 33%
• Parallel Algorithm 100%
• Polynomial Time 66%
• Quadratic Residuosity 33%
• Random Inputs 33%
• Root Counting 33%
• Small Characteristic 66%
• Unconditional Security 33%
• Unexpected Consequences 33%

Computer Science

• Algorithm Design 33%
• Efficient Representation 33%
• Obtain Evidence 33%
• Parallel Algorithms 100%
• Polynomial Time 66%
• Subclasses 66%
• Time Computable Function 33%

Mathematics

• Arbitrary Field 10%
• Finite Field 10%
• Low Degree 10%
• Main Result 20%
• Monomials 10%
• Nonuniform 10%
• Open Question 10%
• Polynomial 100%
• Polynomial Time 20%
• Random Input 10%
• Time Computable Function 10%