The complexity of finding fair independent sets in cycles (Q2087771): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Fair Representation by Independent Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-D Tucker is PPA complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair splitting of colored paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorings and orientations of graphs / 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: Q5111161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for identifying cycle-plus-triangles graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair splittings by independent sets in sparse graphs / 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: Q5365081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Solutions for Envy-Free Cake Cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hamiltonian property of consecutive-\(d\) digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3983100 / 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: A solution to a colouring problem of P. Erdős / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisection of Circle Colorings / 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: Consensus halving for sets of items / rank
 
Normal rank
Property / cites work
 
Property / cites work: How easy is local search? / 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: Computing a small agreeable set of indivisible items / 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: On total functions, existence theorems and computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of almost stable Kneser hypergraphs / 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: Consensus-halving via theorems of Borsuk-Ulam and Tucker / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Kneser coloring theorems with combinatorial proofs / rank
 
Normal rank

Revision as of 13:22, 30 July 2024

scientific article
Language Label Description Also known as
English
The complexity of finding fair independent sets in cycles
scientific article

    Statements

    The complexity of finding fair independent sets in cycles (English)
    0 references
    0 references
    21 October 2022
    0 references
    fair independent sets in cycles
    0 references
    the complexity class \textsf{PPA}
    0 references
    Schrijver graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers