- Home
- » Tags
- » AC (complexity)
Top View
- BQP and the Polynomial Hierarchy∗
- Packing Trominoes Is NP-Complete, #P-Complete and ASP-Complete
- Dependency Stochastic Boolean Satisfiability
- 1 Circuit Complexity
- On the AC [+] Complexity of Andreev's Problem
- A Gentle Introduction to Computational Complexity Theory, and a Little Bit More
- Randomness in Interactive Proofs∗
- Lecture 10 1 Interactive Proofs
- Dspace How-To Guide Tips and Tricks for Managing Common Dspace Chores
- Zero-Knowledge (Intro)
- Unit 7 Creating Digital Libraries Using Dspace
- Using Cloning to Solve NP Complete Problems
- After Dspace Installation Tasks
- A Nearly Optimal Lower Bound on the Approximate Degree of AC0
- COMPUTATIONAL COMPLEXITY Contents
- Finite-Automaton Aperiodicity Is PSPACE-Complete*
- Lecture 22: Parity Is Not in AC0 11/18 Scribe: Nicholas Shiftan
- Enable and Customise the XMLUI Mirage 2 Theme [email protected] Dspace Theme History
- Separation of AC0[Parity] Formulas and Circuits
- Identification and GPC Control of an AC Motor Using DSPACE
- The Oracle Separation of BQP and PH: a Recent Advancement in Quantum Complexity Theory
- AC 0 and Switching Lemma
- Computational Complexity; Slides 11, HT 2021 Circuit Complexity, NC, AC, P-Completeness
- Parity Is Not in AC0
- Lecture 4: Monotone Formulas for Majority; AC0 Circuits Instructor: Benjamin Rossman Scribe: Dmitry Paramonov
- Lecture 5 & 6 1 Threshold Functions and TC
- 6-Uniform Maker-Breaker Game Is PSPACE-Complete
- Lecture 23: Introduction to Quantum Complexity Theory 1 REVIEW
- Complexity-Theoretic Aspects of Interactive Proof Systems
- Lecture 3: the Complexity of Relational Queries 3.1 a Short
- 1 Introduction 2 PSPACE Completeness
- Probabilistically Checkable Proofs of Proximity with Zero-Knowledge⋆
- Lecture 24 Computational Complexity Theory
- AC 0 MOD 2 Lower Bounds for the Boolean Inner Product∗
- The Oracle Separation of BQP and PH
- Probabilistically Checkable Proofs and Their Consequences for Approximation Algorithms
- Circuitschap.Pdf
- Topics in Logic and Complexity Handout 3 P-Complete Problems
- Probabilistically Checkable Proofs
- ACC Circuit Lower Bounds
- Lecture 4: AC Lower Bounds and Pseudorandomness
- The Nielsen Reduction and P-Complete Problems in Free Groups
- Probabilistically Checkable Proofs and Codes
- Succinct Permanent Is NEXP-Hard with Many Hard Instances∗
- Computational Complexity Theory
- Non-Uniform ACC Circuit Lower Bounds
- Probabilistically Checkable Proofs
- Lecture 12: Circuit Complexity
- Arxiv:2106.11886V5 [Cs.CC] 23 Jul 2021 a Negative Answer to P
- A Compression Algorithm for AC0[P] Circuits Using Certifying Polynomials
- Dspace Manual at This Point, You Should Have a Completely Empty, but Fully-Functional Dspace Installation
- A Second Order Theory for TC0
- Oracle Separation of BQP and PH
- Probabilistically Checkable Proofs (PCP)
- On the Concrete Efficiency of Probabilistically-Checkable Proofs
- Pseudorandom Generators and the BQP Vs PH Problem Bill Fefferman (IQI, Caltech) Joint with Chris Umans
- Properties That Characterize LOGCFL*
- Parallel Complexity and P-Complete Problems
- Probabilistically Checkable Proofs
- Lecture 10 Parity /∈ AC 0, and Introducing PCP 1 the Class
- Computational Complexity; Slides 8, HT 2021 PSPACE-Completeness and Quantified Boolean Formulae
- On TC0, AC0, and Arithmetic Circuits
- Fully Parallelized Multi-Prover Protocols for NEXP-Time
- Lecture 11 Uniform Circuit Complexity
- Reducing the Complexity of Reductions
- Recall: Circuit Complexity Depth Parallel Time Width Hardware
- Model Checking Recursive Programs with Numeric Data Types
- Circuit Complexity Classes Lecturer: Jayalal Sarma M N Scribe: Balagopal
- On Completeness and Soundness in Interactive Proof Systems
- Is Bit-Vector Reasoning As Hard As Nexptime in Practice?
- Preservation and Curation in Institutional Repositories
- Relating the PSPACE Reasoning Power of Boolean Programs And
- Probabilistic Complexity Classes and Lowness
- Lecture 24: Probabilistically Checkable Proofs Probabilistically
- BQP and PH Avishay Tal (Stanford University) Joint with Ran Raz (Princeton University)
- On the AC 0 Complexity of Subgraph Isomorphism