Pages that link to "Item:Q435190"

The following pages link to Propositional proofs and reductions between NP search problems (Q435190):

Displaying 26 items.

• Integer factoring and modular square roots (Q896029) (← links)
• Short proofs of the Kneser-Lovász coloring principle (Q1641004) (← links)
• Reductions in \textbf{PPP} (Q1730025) (← links)
• Towards a unified complexity theory of total functions (Q1745728) (← links)
• The Hairy Ball problem is PPAD-complete (Q2229948) (← links)
• Propositional proof systems based on maximum satisfiability (Q2238728) (← links)
• Quasipolynomial size proofs of the propositional pigeonhole principle (Q2344736) (← links)
• Typical forcings, NP search problems and an extension of a theorem of Riis (Q2659102) (← links)
• Minimum propositional proof length is NP-hard to linearly approximate (Q2732273) (← links)
• Automatic Evaluation of Reductions between NP-Complete Problems (Q3192087) (← links)
• Propositional Proofs in Frege and Extended Frege Systems (Abstract) (Q3194704) (← links)
• Short Proofs of the Kneser-Lovász Coloring Principle (Q3449464) (← links)
• Towards a Unified Complexity Theory of Total Functions (Q4993302) (← links)
• Approximate counting and NP search problems (Q5055313) (← links)
• The Hairy Ball Problem is PPAD-Complete. (Q5091222) (← links)
• (Q5092469) (← 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)
• The classes PPA-\(k\): existence from arguments modulo \(k\) (Q5896088) (← links)
• Theory and Applications of Models of Computation (Q5898879) (← links)
• The classes PPA-\(k\): existence from arguments modulo \(k\) (Q5918090) (← links)
• Reductions for non-clausal theorem proving (Q5958754) (← links)
• PPAD-complete approximate pure Nash equilibria in Lipschitz games (Q6069844) (← links)
• PPAD-complete pure approximate Nash equilibria in Lipschitz games (Q6164508) (← 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)