2-D Tucker is PPA complete (Q2009648): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q127200367, #quickstatements; #temporary_batch_1722791855867
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Short proofs of the Kneser-Lovász coloring principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative complexity of NP search problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-size Frege and resolution proofs of \(st\)-connectivity and Hex tautologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of 2D Discrete Fixed Point Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of 2D discrete fixed point problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Settling the complexity of computing two-player Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing a Nash equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Understanding PPA-completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consensus halving is PPA-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Dimension Complexes Part I: Basic Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Dimension Complexes Part II: A Unified Approach to Some Combinatorial Lemmas in Topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive proof of Tucker's combinatorial lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sperner lemma complete for PPA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer factoring and modular square roots / 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: Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the parity argument and other inefficient proofs of existence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian Cycles and Uniquely Edge Colourable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Kneser coloring theorems with combinatorial proofs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127200367 / rank
 
Normal rank

Latest revision as of 18:19, 4 August 2024

scientific article
Language Label Description Also known as
English
2-D Tucker is PPA complete
scientific article

    Statements

    2-D Tucker is PPA complete (English)
    0 references
    0 references
    0 references
    0 references
    29 November 2019
    0 references
    Tucker lemma
    0 references
    NP search problems
    0 references
    parity principle
    0 references
    PPA
    0 references
    TFNP
    0 references

    Identifiers