Pages that link to "Item:Q808245"

The following pages link to On total functions, existence theorems and computational complexity (Q808245):

Displaying 38 items.

• (Q2996237) (← links)
• The Veblen functions for computability theorists (Q3011121) (← links)
• A CSP-Based Approach for Solving Parity Game (Q3507327) (← links)
• Constant Rank Two-Player Games are PPAD-hard (Q4554071) (← links)
• Computational tameness of classical non-causal models (Q4556871) (← links)
• The Journey from NP to TFNP Hardness (Q4638115) (← links)
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines (Q4729768) (← links)
• The fibre of P-matrices: the recursive construction of all matrices with positive principal minors (Q4965585) (← links)
• Towards a Unified Complexity Theory of Total Functions (Q4993302) (← links)
• Hardness results for consensus-halving (Q5005124) (← links)
• The Complexity of Public-Key Cryptography (Q5021130) (← links)
• Relativization of Gurevich’s Conjectures (Q5049042) (← links)
• Approximate counting and NP search problems (Q5055313) (← links)
• Adventures in monotone complexity and TFNP (Q5090415) (← links)
• On the complexity of stable fractional hypergraph matching (Q5091001) (← links)
• Unique End of Potential Line (Q5091211) (← links)
• The Hairy Ball Problem is PPAD-Complete. (Q5091222) (← links)
• (Q5092469) (← links)
• Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds (Q5138782) (← links)
• Structure Versus Hardness Through the Obfuscation Lens (Q5149758) (← links)
• TFNP: An Update (Q5283350) (← links)
• The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich (Q5863324) (← links)
• On the upper bounds for complexities of discrete functions (Q5876808) (← links)
• On the Complexity of Equilibrium Computation in First-Price Auctions (Q5885597) (← links)
• Consensus-Halving: Does It Ever Get Easier? (Q5890032) (← links)
• The classes PPA-\(k\): existence from arguments modulo \(k\) (Q5896088) (← links)
• Quantum and classical query complexities of local search are polynomially related (Q5896965) (← links)
• The classes PPA-\(k\): existence from arguments modulo \(k\) (Q5918090) (← links)
• PPAD-complete approximate pure Nash equilibria in Lipschitz games (Q6069844) (← links)
• Fixed-Parameter Algorithms for the Kneser and Schrijver Problems (Q6154195) (← links)
• PPAD-complete pure approximate Nash equilibria in Lipschitz games (Q6164508) (← links)
• PPAD is as hard as LWE and iterated squaring (Q6169422) (← links)
• Further collapses in \(\mathsf{TFNP}\) (Q6543098) (← links)
• The frontier of intractability for EFX with two agents (Q6546301) (← links)
• The complexity of gradient descent: CLS = PPAD \(\cap\) pls (Q6567266) (← links)
• Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024 (Q6613418) (← links)
• The parameterized complexity of welfare guarantees in Schelling segregation (Q6614026) (← links)
• Note on constrained long choice with multiple beginning elements (Q6661767) (← links)