Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma (Q5130843): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q124882178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4266552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short PCPs with Projection Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ACC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some New Consequences of the Hypothesis That P Has Fixed Polynomial-Size Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient learning algorithms yield circuit lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: New non-uniform lower bounds for uniform classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust simulations and significant separations / rank
 
Normal rank
Property / cites work
 
Property / cites work: In search of an easy witness: Exponential time vs. probabilistic polynomial time. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuit-size lower bounds and non-reducibility to sparse sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines that take advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Collapse Consequences of NP Having Small Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic methods for interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness vs randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuit Lower Bounds for Merlin–Arthur Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating Nondeterministic Time Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators without the XOR lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniformity and circuit lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandomness and average-case complexity via uniform reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-random generators for all hardnesses / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms and lower bounds for circuits with linear threshold gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonuniform ACC Circuit Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving Exhaustive Search Implies Superpolynomial Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5121894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural Proofs versus Derandomization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Turing machine time hierarchy / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/18m1195887 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3009964738 / rank
 
Normal rank

Latest revision as of 10:45, 30 July 2024

scientific article; zbMATH DE number 7268367
Language Label Description Also known as
English
Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma
scientific article; zbMATH DE number 7268367

    Statements

    Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma (English)
    0 references
    0 references
    0 references
    29 October 2020
    0 references
    circuit complexity
    0 references
    lower bounds
    0 references
    nondeterminism
    0 references
    Merlin-Arthur protocols
    0 references
    ACC
    0 references
    satisfiability
    0 references
    pseudorandomness
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references