Note on constrained long choice with multiple beginning elements
From MaRDI portal
Publication:6661767
DOI10.1007/S00224-024-10209-4MaRDI QIDQ6661767
Publication date: 13 January 2025
Published in: Theory of Computing Systems (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20)
Cites Work
- Title not available (Why is that?)
- On total functions, existence theorems and computational complexity
- On the complexity of finding falsifying assignments for Herbrand disjunctions
- Integer factoring and modular square roots
- How easy is local search?
- On the complexity of the parity argument and other inefficient proofs of existence
- Towards a unified complexity theory of total functions
- Unique end of potential line
- Settling the complexity of computing two-player Nash equilibria
- Consensus halving is PPA-complete
- On Search Complexity of Discrete Logarithm
- The frontier of intractability for EFX with two agents
- Further collapses in TFNP
- Extremal combinatorics, iterated pigeonhole arguments and generalizations of PPP
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)
