Conference paper
A quantitative analysis of OS noise
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011
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.
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989
Victor Valls, Panagiotis Promponas, et al.
IEEE Communications Magazine
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996