DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» AC0
AC0
On Uniformity Within NC
On the NP-Completeness of the Minimum Circuit Size Problem
Week 1: an Overview of Circuit Complexity 1 Welcome 2
A Short History of Computational Complexity
Multiparty Communication Complexity and Threshold Circuit Size of AC^0
Verifying Proofs in Constant Depth
Lecture 13: Circuit Complexity 1 Binary Addition
Lecture 5: the Landscape of Complexity Classes 1. Our Current
AC0[P] Lower Bounds Against MCSP Via the Coin Problem
Delegating Computation: Interactive Proofs for Muggles
An Isomorphism Theorem and a Gap Theorem
BQP and the Polynomial Hierarchy∗
AC0[P] Lower Bounds Against MCSP Via the Coin Problem
Lecture 16: Parity Is Not in AC0 Anup Rao May 22, 2020
Circuit Complexity, Proof Complexity, and Polynomial Identity Testing
The Inapproximability of K-DOMINATINGSET for Parameterized AC0 Circuits †
Constant-Round Interactive Proof Systems for AC0[2] and NC1
Interactive Proofs for Social Graphs
Top View
Lecture Notes
Lecture 3: the Complexity of Relational Queries 3.1 a Short
MAEXP Lower Bound
Minimizing Dnf Formulas and Ac0 Circuits Given a Truth Table
BQP and the Polynomial Hierarchy
Separating Ac0 from Depth-2 Majority Circuits∗ 1
Razborov-Smolensky Scribe: Brian Chen Mohammad Bavarian Scribe Date: Spring 2016
Interactive Proofs for Verifying Machine Learning
On the Descriptive Complexity of Color Coding †
New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems
Proof Verification in Constant Depth
Separation of AC0[Parity] Formulas and Circuits
Constant-Round Interactive Proof Systems for AC0[2] and NC1
Intermediate Lower Bounds and Their Relationship with Complexity Theory by Dylan Mckay B.S
AC 0 and Switching Lemma
A Model-Theoretic Characterization of Constant-Depth Arithmetic Circuits
Parity Is Not in AC0
A Superpolynomial Lower Bound on the Size of Uniform Non-Constant