Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,430,708 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
Co-NP
Complete (complexity)
Complexity class
Computational complexity theory
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Démonstrations C.C-Goldbach Par le TFNP .
B. Mohamed
2019
Corpus ID: 155968948
en ce qui concerne la conjecture forte, chaque nombre pair n, a partir de 4 peut generer plusieurs couples dont les elements a et…
Expand
2018
2018
An interactive version of the Lov´asz local lemma
L. Kirousis
,
John Livieratos
,
Kostas I. Psaromiligkos
2018
Corpus ID: 6012199
,
2018
2018
L O ] 2 0 A pr 2 01 8 Enumeration in Incremental FPT-Time
A. Meier
2018
Corpus ID: 51693859
In this paper, we study the relationship of parametrised enumeration complexity classes defined by Creignou et al. (MFCS 2013…
Expand
2017
2017
An interactive version of Lovász local lemma: Arthur and Merlin implement Moser's algorithm
L. Kirousis
,
John Livieratos
,
Kostas I. Psaromiligkos
arXiv.org
2017
Corpus ID: 125521838
Assume we are given (finitely many) mutually independent variables and (finitely many) "undesirable" events each depending on a…
Expand
2015
2015
Hippotherapy as a technique of habilitation and rehabilitation
Lina María López-Roa
,
Efraín Darío Moreno-Rodríguez
2015
Corpus ID: 147658441
The habilitation and rehabilitation are processes through which people with disabilities go through to maintain optimal results…
Expand
2011
2011
EFECTO DE LA INTERVENCIÓN FISIOTERAPEUTICA BASADA EN EL USO DE FÉRULAS Y TÉCNICAS DE FACILITACIÓN NEUROMUSCULAR PROPIOCEPTIVA (TFNP), EN LA MOVILIDAD ARTICULAR DE NIÑOS CON QUEMADURAS DE II GRADO
María E Tavera
,
J. Maya
,
Karen Cristina Rodriguez Atehortua
,
Lina Marcela Tapias Urrego
2011
Corpus ID: 68029551
Burns generates large destruction in soft tissues, especially the skin, which implicates prolonged immobility favoring the…
Expand
Review
2009
Review
2009
Survey of the Computational Complexity of Finding a Nash Equilibrium
Valerie Ishida
2009
Corpus ID: 17703315
For many years it was unknown whether a Nash Equilibrium of a normal form game could be found in polynomial time. The motivation…
Expand
2009
2009
ELABORACION DE UN OBJETO VIRTUAL DE APRENDIZAJE (OVA) SOBRE “TECNICAS DE FACILITACION NEUROMUSCULAR PROPIOCEPTIVA”
I. Díaz
2009
Corpus ID: 170981995
El presente resumen corresponde a un ejercicio de innovacion en el aula que se constituye en un aporte en el marco de los…
Expand
2006
2006
Inverting onto functions might not be hard
H. Buhrman
,
L. Fortnow
,
M. Koucký
,
J. Rogers
,
N. Vereshchagin
Electron. Colloquium Comput. Complex.
2006
Corpus ID: 14663781
The class TFNP, dened by Megiddo and Papadimitriou, consists of multivalued functions with values that are polynomially veriable…
Expand
1996
1996
On Inverting Onto
F. Fenner
,
L. Fortnow
,
A. Naik
,
J. Rogers
1996
Corpus ID: 8950720
We study the complexity of inverting many-one, honest, polynomial-time computable onto functions. Asserting that every polynomial…
Expand