scientific article; zbMATH DE number 7204266
From MaRDI portal
Publication:5111145
DOI10.4230/LIPIcs.CCC.2017.15zbMath1440.68084MaRDI QIDQ5111145
Publication date: 26 May 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Networks and circuits as models of computation; circuit complexity (68Q06)
Related Items (21)
Expander-based cryptography meets natural proofs ⋮ An Optimal Separation of Randomized and Quantum Query Complexity ⋮ Quantified Derandomization: How to Find Water in the Ocean ⋮ On the probabilistic degree of OR over the reals ⋮ Influence of a Set of Variables on a Boolean Function ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ Unnamed Item ⋮ The work of Mark Braverman ⋮ On polynomial approximations to AC ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Expander-Based Cryptography Meets Natural Proofs ⋮ Criticality of regular formulas ⋮ Near-optimal pseudorandom generators for constant-depth read-once formulas ⋮ Fourier bounds and pseudorandom generators for product tests ⋮ Explicit two-source extractors and resilient functions ⋮ Unnamed Item ⋮ Harmonicity and invariance on slices of the Boolean cube ⋮ Interactive proofs for social graphs ⋮ Pseudorandom Functions: Three Decades Later
This page was built for publication:
