Computing exact solutions of consensus halving and the Borsuk-Ulam theorem (Q2221804): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Q1125794 / rank
Normal rank
 
Property / author
 
Property / author: Paul G. Spirakis / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3101401168 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1903.03101 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Who Needs Crossings? Hardness of Plane Graph Rigidity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The art gallery problem is ∃ ℝ-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-1 bimatrix games / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-D Tucker is PPA complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting necklaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Borsuk-Ulam Theorem and Bisection of Necklaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved envy-free cake cutting protocol for four agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete and bounded envy-free cake cutting protocol for four agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of decision problems about multi-player Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some provably hard crossing number problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of rational and irrational Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existential-R-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Envy-Free Cake Division Protocol / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4338900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition and complexity of point visibility graphs / 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: Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Understanding PPA-completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rental Harmony: Sperner's Lemma in Fair Division / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Nash Equilibria and Other Fixed Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5005124 / 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: Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sperner lemma complete for PPA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidding for envy-freeness: a procedural approach to \(n\)-player fair-division problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Separators in String Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant rank bimatrix games are PPAD-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-min representation of piecewise linear functions / 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: Inapproximability of Nash Equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Some Geometric and Topological Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizability of Graphs and Linkages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on square roots of nonnegative matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Positive Semidefinite Matrix Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consensus-halving via theorems of Borsuk-Ulam and Tucker / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized ''sandwich'' theorems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:22, 24 July 2024

scientific article
Language Label Description Also known as
English
Computing exact solutions of consensus halving and the Borsuk-Ulam theorem
scientific article

    Statements

    Computing exact solutions of consensus halving and the Borsuk-Ulam theorem (English)
    0 references
    0 references
    0 references
    0 references
    2 February 2021
    0 references
    PPA
    0 references
    FIXP
    0 references
    ETR
    0 references
    consensus halving
    0 references
    circuit
    0 references
    reduction
    0 references
    complexity class
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references