Short Proofs of the Kneser-Lovász Coloring Principle (Q3449464): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: QUASIPOLYNOMIAL SIZE FREGE PROOFS OF FRANKL’S THEOREM ON THE TRACE OF SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial size proofs of the propositional pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional proofs and reductions between NP search problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasipolynomial size proofs of the propositional pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative efficiency of propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof Complexity and the Kneser-Lovász Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual weak pigeonhole principle, Boolean complexity, and derandomization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kneser's conjecture, chromatic number, and homotopy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorical proof of Kneser's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Propositional Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Kneser coloring theorems with combinatorial proofs / rank
 
Normal rank

Revision as of 00:10, 11 July 2024

scientific article
Language Label Description Also known as
English
Short Proofs of the Kneser-Lovász Coloring Principle
scientific article

    Statements

    Identifiers