LOWER BOUNDS FOR DNF-REFUTATIONS OF A RELATIVIZED WEAK PIGEONHOLE PRINCIPLE (Q5501765): 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 / OpenAlex ID
 
Property / OpenAlex ID: W2105447726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximate majority and probabilistic time / 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
Property / cites work
 
Property / cites work: A Remark on Stirling's Formula / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complexity gap for tree resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space complexity of random formulae in resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential lower bounds for the pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniformity within \(NC^ 1\) / 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: On sufficient conditions for unsatisfiability of random formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs are narrow—resolution made simple / rank
 
Normal rank
Property / cites work
 
Property / cites work: Special issue: Mathematical foundations of computer science. Selected papers from the 26th international symposium on mathematical foundations of computer science (MFCS 2001), Mariánské Lázně, Czech Republic, August 27-31, 2001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4275381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical computer science. Petri nets. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution lower bounds for the weak pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs as Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of the weak pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics of first order structures and propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the weak pigeonhole principle / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:09, 10 July 2024

scientific article; zbMATH DE number 6472561
Language Label Description Also known as
English
LOWER BOUNDS FOR DNF-REFUTATIONS OF A RELATIVIZED WEAK PIGEONHOLE PRINCIPLE
scientific article; zbMATH DE number 6472561

    Statements

    LOWER BOUNDS FOR DNF-REFUTATIONS OF A RELATIVIZED WEAK PIGEONHOLE PRINCIPLE (English)
    0 references
    0 references
    0 references
    0 references
    14 August 2015
    0 references
    proof complexity
    0 references
    bounded arithmetic
    0 references
    weak pigeonhole principles
    0 references
    approximate counting
    0 references
    bounded-depth Frege
    0 references
    0 references
    0 references
    0 references

    Identifiers