Robert G. Farrell, Catalina M. Danis, et al.
RecSys 2012
Nondeterministic 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 optimization, Brouwer's fixed points, a computational version of Sperner's Lemma, bimatrix equilibria in games, and linear complementarity for P-matrices. © 1991.
Robert G. Farrell, Catalina M. Danis, et al.
RecSys 2012
Apostol Natsev, Alexander Haubold, et al.
MMSP 2007
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering