Conference paper
Social networks and discovery in the enterprise (SaND)
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009
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.
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
Chi-Leung Wong, Zehra Sura, et al.
I-SPAN 2002
Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS