Pages that link to "Item:Q1329155"

The following pages link to On the complexity of the parity argument and other inefficient proofs of existence (Q1329155):

Displaying 38 items.

• The NP Search Problems of Frege and Extended Frege Proofs (Q5278209) (← links)
• TFNP: An Update (Q5283350) (← links)
• The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata (Q5418964) (← links)
• Approximate Equilibria for Strategic Two Person Games (Q5459968) (← links)
• Strategic Characterization of the Index of an Equilibrium (Q5459988) (← links)
• (Q5711939) (← links)
• From Minicrypt to Obfustopia via Private-Key Functional Encryption (Q5738873) (← links)
• CONSISTENCY OF CIRCUIT EVALUATION, EXTENDED RESOLUTION AND TOTAL NP SEARCH PROBLEMS (Q5739904) (← links)
• The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich (Q5863324) (← links)
• Fully Polynomial-Time Approximation Schemes for Fair Rent Division (Q5868945) (← links)
• Consensus Halving for Sets of Items (Q5870379) (← links)
• (Q5881546) (← links)
• On the Complexity of Equilibrium Computation in First-Price Auctions (Q5885597) (← links)
• Consensus-Halving: Does It Ever Get Easier? (Q5890032) (← links)
• Minimal and hyper-minimal biautomata (Q5890813) (← links)
• Approximating Tverberg points in linear time for any fixed dimension (Q5891192) (← links)
• The classes PPA-\(k\): existence from arguments modulo \(k\) (Q5896088) (← links)
• New and simple algorithms for stable flow problems (Q5915793) (← links)
• The classes PPA-\(k\): existence from arguments modulo \(k\) (Q5918090) (← links)
• Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness (Q5918360) (← links)
• Can PPAD hardness be based on standard cryptographic assumptions? (Q5925502) (← links)
• On search of Nash equilibrium in quasiconcave quadratic games (Q6054229) (← links)
• PPAD-complete approximate pure Nash equilibria in Lipschitz games (Q6069844) (← links)
• Public goods games in directed networks (Q6102516) (← links)
• On finding constrained independent sets in cycles (Q6130317) (← links)
• Fixed-Parameter Algorithms for the Kneser and Schrijver Problems (Q6154195) (← links)
• $$\mathcal {NP}$$-Hardness of Equilibria in Case of Risk-Averse Players (Q6163639) (← links)
• Simultaneous contests with equal sharing allocation of prizes: computational complexity and price of anarchy (Q6164505) (← links)
• PPAD-complete pure approximate Nash equilibria in Lipschitz games (Q6164508) (← links)
• PPAD is as hard as LWE and iterated squaring (Q6169422) (← links)
• Approximating subset sum ratio via partition computations (Q6541032) (← links)
• Further collapses in \(\mathsf{TFNP}\) (Q6543098) (← links)
• The complexity of iterated reversible computation (Q6566596) (← 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)
• Approximate and randomized algorithms for computing a second Hamiltonian cycle (Q6614106) (← links)
• Note on constrained long choice with multiple beginning elements (Q6661767) (← links)