The complexity of the pigeonhole principle (Q1343166): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Resolution proofs of generalized pigeonhole principles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3689182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting $Δ_0$ sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provability of the pigeonhole principle and the existence of infinitely many primes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard examples for resolution / rank
 
Normal rank

Revision as of 10:38, 23 May 2024

scientific article
Language Label Description Also known as
English
The complexity of the pigeonhole principle
scientific article

    Statements

    The complexity of the pigeonhole principle (English)
    0 references
    1 February 1995
    0 references
    pigeonhole principle
    0 references
    unlimited fan-in constant depth polynomial size Boolean formula
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references