Note on constrained long choice with multiple beginning elements
From MaRDI portal
Recommendations
Cites work
- Consensus halving is PPA-complete
- Extremal combinatorics, iterated pigeonhole arguments and generalizations of PPP
- Further collapses in TFNP
- How easy is local search?
- scientific article; zbMATH DE number 6783433 (Why is no real title available?)
- Integer factoring and modular square roots
- On Search Complexity of Discrete Logarithm
- On the complexity of finding falsifying assignments for Herbrand disjunctions
- On the complexity of the parity argument and other inefficient proofs of existence
- On total functions, existence theorems and computational complexity
- Settling the complexity of computing two-player Nash equilibria
- The frontier of intractability for EFX with two agents
- Towards a unified complexity theory of total functions
- Unique end of potential line
This page was built for publication: Note on constrained long choice with multiple beginning elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6661767)