Skip to search formSkip to main contentSkip to account menu

TFNP

In computational complexity theory, the complexity class TFNP is a subclass of FNP where a solution is guaranteed to exist. It stands for "Total… 
Wikipedia (opens in a new tab)

Related topics

Related topics

15 relations
Co-NPComplete (complexity)Complexity classComputational complexity theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Adventures in Monotone Complexity and TFNP
Separations: We introduce a monotone variant of Xor-Sat and show it has exponential monotone circuit complexity. Since Xor-Sat is… 
2018
2018
An interactive version of the Lov´asz local lemma
, 
Review
2017
Review
2017
TFNP: An Update
The class TFNP was introduced a quarter of a century ago to capture problems in NP that have a witness for all inputs. A decade… 
Highly Cited
2017
Highly Cited
2017
Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds
Local search proved to be an extremely useful tool when facing hard optimization problems (e.g., via the simplex algorithm… 
2016
2016
The Journey from NP to TFNP Hardness
The class TFNP is the search analog of NP with the additional guarantee that any instance has a solution. TFNP has attracted… 
2012
2012
Propositional proofs and reductions between NP search problems
2010
2010
On the Power of Randomized Reductions and the Checkability of SAT
We prove new results regarding the complexity of various complexity classes under randomized oracle reductions. We first prove… 
Review
2009
Review
2009
Survey of the Computational Complexity of Finding a Nash Equilibrium
For many years it was unknown whether a Nash Equilibrium of a normal form game could be found in polynomial time. The motivation… 
Highly Cited
2009
Highly Cited
2009
Reducibility among Fractional Stability Problems
In a landmark paper, Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP… 
Review
2008
Review
2008
Equilibria, Fixed Points, and Complexity Classes
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)