AAAAAA
Results:
1-19
|
Results: 19
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 LA
HEMPEL H
WECHSUNG G
Citation: La. Hemaspaandra et al., QUERY ORDER, SIAM journal on computing (Print), 28(2), 1999, pp. 637-651
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 LA
JIANG Z
ROTHE J
WATANABE O
Citation: La. Hemaspaandra et al., BOOLEAN OPERATIONS, JOINS, AND THE EXTENDED LOW HIERARCHY, Theoretical computer science, 205(1-2), 1998, pp. 317-327
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 LA
ROTHE J
Citation: La. Hemaspaandra et J. Rothe, UNAMBIGUOUS COMPUTATION - BOOLEAN HIERARCHIES AND SPARSE TURING-COMPLETE SETS, SIAM journal on computing, 26(3), 1997, pp. 634-653
Authors:
HAN YN
HEMASPAANDRA LA
THIERAUF T
Citation: Yn. Han et al., THRESHOLD COMPUTATION AND CRYPTOGRAPHIC SECURITY, SIAM journal on computing, 26(1), 1997, pp. 59-78
Authors:
HEMASPAANDRA LA
OGIHARA M
Citation: La. Hemaspaandra et M. Ogihara, UNIVERSALLY SERIALIZABLE COMPUTATION, Journal of computer and system sciences, 55(3), 1997, pp. 547-560
Authors:
HEMASPAANDRA LA
ROTHE J
WECHSUNG G
Citation: La. Hemaspaandra et al., EASY SETS AND HARD CERTIFICATE SCHEMES, Acta informatica, 34(11), 1997, pp. 859-879
Authors:
HAN YJ
HEMASPAANDRA LA
Citation: Yj. Han et La. Hemaspaandra, PSEUDORANDOM GENERATORS AND THE FREQUENCY OF SIMPLICITY, Journal of cryptology, 9(4), 1996, pp. 251-261
Authors:
HEMASPAANDRA LA
HOENE A
OGIHARA M
Citation: La. Hemaspaandra et al., REDUCIBILITY CLASSES OF P-SELECTIVE SETS, Theoretical computer science, 155(2), 1996, pp. 447-457
Authors:
HEMASPAANDRA LA
TORENVLIET L
Citation: La. Hemaspaandra et L. Torenvliet, OPTIMAL ADVICE, Theoretical computer science, 154(2), 1996, pp. 367-377
Authors:
HEMASPAANDRA LA
NAIK AV
OGIHARA M
SELMAN AL
Citation: La. Hemaspaandra et al., COMPUTING SOLUTIONS UNIQUELY COLLAPSES THE POLYNOMIAL HIERARCHY, SIAM journal on computing, 25(4), 1996, pp. 697-708
Authors:
HEMASPAANDRA LA
ZIMAND M
Citation: La. Hemaspaandra et M. Zimand, STRONG SELF-REDUCIBILITY PRECLUDES STRONG IMMUNITY, Mathematical systems theory, 29(5), 1996, pp. 535-548
Authors:
HEMASPAANDRA LA
JHA SK
Citation: La. Hemaspaandra et Sk. Jha, DEFYING UPWARD AND DOWNWARD SEPARATION, Information and computation, 121(1), 1995, pp. 1-13
Authors:
HEMASPAANDRA LA
JIANG ZG
Citation: La. Hemaspaandra et Zg. Jiang, P-SELECTIVITY - INTERSECTIONS AND INDEXES, Theoretical computer science, 145(1-2), 1995, pp. 371-380
Authors:
HEMASPAANDRA LA
SILVESTRI R
Citation: La. Hemaspaandra et R. Silvestri, EASILY CHECKED GENERALIZED SELF-REDUCIBILITY, SIAM journal on computing, 24(4), 1995, pp. 840-858
Authors:
HEMASPAANDRA E
HEMASPAANDRA LA
Citation: E. Hemaspaandra et La. Hemaspaandra, QUASI-INJECTIVE REDUCTIONS, Theoretical computer science, 123(2), 1994, pp. 407-413
Authors:
KRATSCH D
HEMASPAANDRA LA
Citation: D. Kratsch et La. Hemaspaandra, ON THE COMPLEXITY OF GRAPH RECONSTRUCTION, Mathematical systems theory, 27(3), 1994, pp. 257-273
Risultati:
1-19
|