Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-4
|
Results: 4
PROBABILISTIC CHECKING OF PROOFS - A NEW CHARACTERIZATION OF NP
Authors:
ARORA S SAFRA S
Citation:
S. Arora et S. Safra, PROBABILISTIC CHECKING OF PROOFS - A NEW CHARACTERIZATION OF NP, JOURNAL OF THE ACM, 45(1), 1998, pp. 70-122
ON DATA-STRUCTURES AND ASYMMETRIC COMMUNICATION COMPLEXITY
Authors:
MILTERSEN PB NISAN N SAFRA S WIGDERSON A
Citation:
Pb. Miltersen et al., ON DATA-STRUCTURES AND ASYMMETRIC COMMUNICATION COMPLEXITY, Journal of computer and system sciences (Print), 57(1), 1998, pp. 37-49
INTERACTIVE PROOFS AND THE HARDNESS OF APPROXIMATING CLIQUES
Authors:
FEIGE U GOLDWASSER S LOVASZ L SAFRA S SZEGEDY M
Citation:
U. Feige et al., INTERACTIVE PROOFS AND THE HARDNESS OF APPROXIMATING CLIQUES, Journal of the ACM, 43(2), 1996, pp. 268-292
A WELL-CHARACTERIZED APPROXIMATION PROBLEM
Authors:
HASTAD J PHILLIPS S SAFRA S
Citation:
J. Hastad et al., A WELL-CHARACTERIZED APPROXIMATION PROBLEM, Information processing letters, 47(6), 1993, pp. 301-305
Risultati:
1-4
|