Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.4007/annals.2015.181.2.1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2114400329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the weak pigeonhole principle and random formulas beyond resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space Complexity in Propositional Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Generators in Propositional Proof Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3503433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lower bounds by polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear gaps between degrees for the polynomial calculus modulo distinct primes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random CNF's are hard for the polynomial calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exponential separation between the parity principle and the pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4790380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for cutting planes proofs with small coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Interpolation and Automatization for Frege Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness conductors and constant-degree lossless expanders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3729902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Candidate One-Way Functions Based on Expander Graphs / 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: Poisson approximation for large deviations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some consequences of cryptographical conjectures for \(S_2^1\) and EF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4699287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the weak pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tautologies from Pseudo-Random Generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: CREW PRAM<scp>s</scp> and Decision Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness vs randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for resolution and cutting plane proofs and monotone computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular resolution lower bounds for the weak pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818823 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the polynomial calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution lower bounds for perfect matching principles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Switching Lemma for Small Restrictions and Lower Bounds for <i>k</i>-DNF Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Propositional Proofs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:00, 9 July 2024

scientific article
Language Label Description Also known as
English
Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution
scientific article

    Statements

    Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (English)
    0 references
    9 February 2015
    0 references
    proof complexity
    0 references
    pseudorandom generators
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers