The classes PPA-\(k\): existence from arguments modulo \(k\) (Q5896088): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Splitting necklaces / 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: Lower Bounds on Hilbert's Nullstellensatz and Propositional Proofs / 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: Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities / 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 Non-Monotone Markets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of equilibria: Hardness results for economies via a correspondence with games / 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: Q5365081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of pure Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unique End of Potential Line / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of splitting necklaces and bisecting ham sandwiches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consensus halving is PPA-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hairy Ball Problem is PPAD-Complete. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a unified complexity theory of total functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer factoring and modular square roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: How easy is local search? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Fractional Stability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Borsuk--Ulam-property, Tucker-property and constructive proofs in combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On total functions, existence theorems and computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplotopal maps and necklace splitting / 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: On the complexity of finding falsifying assignments for Herbrand disjunctions / rank
 
Normal rank

Latest revision as of 00:10, 23 July 2024

scientific article; zbMATH DE number 7216344
Language Label Description Also known as
English
The classes PPA-\(k\): existence from arguments modulo \(k\)
scientific article; zbMATH DE number 7216344

    Statements

    The classes PPA-\(k\): existence from arguments modulo \(k\) (English)
    0 references
    30 June 2020
    0 references
    computational complexity
    0 references
    TFNP
    0 references
    necklace splitting
    0 references
    0 references
    0 references

    Identifiers