Khaled A.S. Abdel-Ghaffar
IEEE Trans. Inf. Theory
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.
Khaled A.S. Abdel-Ghaffar
IEEE Trans. Inf. Theory
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
Fan Zhang, Junwei Cao, et al.
IEEE TETC