AAAAAA
Results:
1-8
|
Results: 8
Authors:
HEMASPAANDRA E
HEMASPAANDRA LA
HEMPEL H
Citation: E. Hemaspaandra et al., A DOWNWARD COLLAPSE WITHIN THE POLYNOMIAL HIERARCHY, SIAM journal on computing (Print), 28(2), 1999, pp. 383-393
Authors:
HEMASPAANDRA E
HEMASPAANDRA LA
HEMPEL H
Citation: E. Hemaspaandra et al., R-1-TT(SN)(NP) DISTINGUISHES ROBUST MANY-ONE AND TURING COMPLETENESS, theory of computing systems, 31(3), 1998, pp. 307-325
Authors:
HEMASPAANDRA E
ROTHE J
Citation: E. Hemaspaandra et J. Rothe, RECOGNIZING WHEN GREED CAN APPROXIMATE MAXIMUM INDEPENDENT SETS IS COMPLETE FOR PARALLEL ACCESS TO NP, Information processing letters, 65(3), 1998, pp. 151-156
Authors:
HEMASPAANDRA E
HEMASPAANDRA LA
ROTHE J
Citation: E. Hemaspaandra et al., EXACT ANALYSIS OF DODGSON ELECTIONS - CARROLL,LEWIS 1876 VOTING SYSTEM IS COMPLETE FOR PARALLEL ACCESS TO NP, JOURNAL OF THE ACM, 44(6), 1997, pp. 806-825
Authors:
HEMASPAANDRA E
NAIK AV
OGIHARA M
SELMAN AL
Citation: E. Hemaspaandra et al., P-SELECTIVE SETS AND REDUCING SEARCH TO DECISION VS SELF-REDUCIBILITY, Journal of computer and system sciences, 53(2), 1996, pp. 194-209
Authors:
BUHRMAN H
HEMASPAANDRA E
LONGPRE L
Citation: H. Buhrman et al., SPARSE REDUCES CONJUNCTIVELY TO TALLY, SIAM journal on computing, 24(4), 1995, pp. 673-681
Authors:
HEMASPAANDRA E
HEMASPAANDRA LA
Citation: E. Hemaspaandra et La. Hemaspaandra, QUASI-INJECTIVE REDUCTIONS, Theoretical computer science, 123(2), 1994, pp. 407-413
Authors:
HEMASPAANDRA E
Citation: E. Hemaspaandra, CENSUS TECHNIQUES COLLAPSE SPACE CLASSES, Information processing letters, 51(2), 1994, pp. 79-84
Risultati:
1-8
|