On Total Functions, Existence Theorems and Computational Complexity

  title={On Total Functions, Existence Theorems and Computational Complexity},
  author={Nimrod Megiddo and Christos H. Papadimitriou},
  journal={Theor. Comput. Sci.},
Megiddo, N. and C.H. Papadimitriou, On total functions, existence theorems and computational complexity (Note), Theoretical Computer Science 81 (1991) 317-324. wondeterministic multivalued functions with values that are polynomially verifiable and guaranteed to exist form an interesting complexity class between P and NP. We show that this class, which we call TFNP, contains a host of important problems, whose membership in P is currently not known. These include, besides factoring, local… CONTINUE READING
Highly Influential
This paper has highly influenced 25 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 176 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 114 extracted citations

177 Citations

Citations per Year
Semantic Scholar estimates that this publication has 177 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 10 references

Linear Complementarity, Linear and Nonlinear Programming (Heldermann Verlag, Berlin

K. G. Murty

\ Bimatrix equilibrium points and mathematical programming

C. E. Lemke

Exponential lower bounds for finding Brouwer fixed points

28th Annual Symposium on Foundations of Computer Science (sfcs 1987) • 1987

Solving LCP on P-matrices is probably not NP-hard

D. Solow, R. Stone, C. A. Tovey

How easy is local search?

26th Annual Symposium on Foundations of Computer Science (sfcs 1985) • 1985

Pratt , \ Every prime has a succinct certi cate

R. V.
SIAM J . Comput . • 1975

Wesler, A partition theorem for Euclidean n-space

H. Samelson, R. M. Thrall
Proc. Amer. Math. Sac • 1958

Similar Papers

Loading similar papers…