THU, 09.07.2020, 15:30-16:30 UTC+2
Papers:
• Symmetric Arithmetic Circuits
• Hardness of equations over finite solvable groups under the exponential time hypothesis
• Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity
• Can Verifiable Delay Functions be Based on Random Oracles?
• Feasible Interpolation for Polynomial Calculus and Sums-of-Squares
• On the Degree of Boolean Functions as Polynomials over ℤ_m
