Live briefing
Everything about TFNP
Complexity class
In computational complexity theory, the complexity class TFNP is the class of total function problems that can be solved in nondeterministic polynomial time. That is, it is the class of function problems that are guaranteed to have an answer, and this answer can be checked in polynomial time, or equivalently it is the subset of FNP where a solution is guaranteed to exist. The abbreviation TFNP stands for "Total Function Nondeterministic Polynomial". Wikipedia ā
š§ Start here: a 6-step reading path
- Read the overview: TFNPA 5-minute orientation
- Read the landmark paper: Synthesis and Analysis of (Ī³,Ī³ā,Ī³āā āTrifluoro)neopentyl (TFNP) Aryl Ethers as a Polar Fluoroaliphatic MotifCited 5 times
- Go sideways: PPP (complexity)A closely related topic
- Go sideways: PPAD (complexity)A closely related topic
š Definitions
No dictionary entry for this exact phrase.
šļø The subject at a glance
š Landmark papers (most cited)
š Books worth reading
Open Library didn't respond; try again in a moment.
š Related topics
- PPP (complexity) In computational complexity theory, the complexity class PPP (polynomial pigeonhole principle) is a subclass of TFNP. It is the class of search problemsā¦
- PPAD (complexity) In computer science, PPAD ("Polynomial Parity Arguments on Directed graphs") is a complexity class introduced by Christos Papadimitriou in 1994. PPAD isā¦
- Counting problem (complexity) In computational complexity theory and computability theory, a counting problem is a type of computational problem that is obtained by strengthening aā¦
- P (complexity) In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is a fundamental complexity class. It contains all decision problems that canā¦
- Padding argument In computational complexity theory, the padding argument is a tool to conditionally prove that if some complexity classes are equal, then some other biggerā¦
- KarpāLipton theorem In complexity theory, the KarpāLipton theorem states that if the Boolean satisfiability problem (SAT) can be solved by Boolean circuits with a polynomialā¦
- Function problem In computational complexity theory, a function problem is a computational problem where a single output is expected for every input, but the output isā¦
- Circuit complexity In theoretical computer science, circuit complexity is a branch of computational complexity theory in which Boolean functions are classified accordingā¦