The complexity of the parity argument with potential (Q2037189): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2021.03.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3136449553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-D Tucker is PPA complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication complexity of approximate Nash equilibria / 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: Zero-Sum Polymatrix Games: A Generalization of Minmax / 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: Q5365081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A converse to Banach's fixed point theorem and its CLS-completeness / 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: Consensus halving is PPA-complete / 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: The Hairy Ball Problem is PPAD-Complete. / rank
 
Normal rank
Property / cites work
 
Property / cites work: TFNP: An Update / 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: Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: How easy is local search? / 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: On the complexity of the parity argument and other inefficient proofs of existence / rank
 
Normal rank

Latest revision as of 03:23, 26 July 2024

scientific article
Language Label Description Also known as
English
The complexity of the parity argument with potential
scientific article

    Statements

    The complexity of the parity argument with potential (English)
    0 references
    0 references
    30 June 2021
    0 references
    computational complexity
    0 references
    search problems
    0 references
    PPA
    0 references
    PLS
    0 references
    EOPL
    0 references

    Identifiers