AAAAAA
Results: 1-25/383
Authors:
CAI JY
Citation: Jy. Cai, 11TH ANNUAL CONFERENCE ON STRUCTURE IN COMPLEXITY 1996 - FOREWORD, Journal of computer and system sciences (Print), 57(2), 1998, pp. 125-125
Authors:
AGRAWAL M
ALLENDER E
RUDICH S
Citation: M. Agrawal et al., REDUCTIONS IN CIRCUIT COMPLEXITY - AN ISOMORPHISM THEOREM AND A GAP THEOREM, Journal of computer and system sciences (Print), 57(2), 1998, pp. 127-143
Authors:
BARLAND I
KOLAITIS PG
THAKUR MN
Citation: I. Barland et al., INTEGER PROGRAMMING AS A FRAMEWORK FOR OPTIMIZATION AND APPROXIMABILITY, Journal of computer and system sciences (Print), 57(2), 1998, pp. 144-161
Authors:
BUSS SR
PITASSI T
Citation: Sr. Buss et T. Pitassi, GOOD DEGREE BOUNDS ON NULLSTELLENSATZ REFUTATIONS OF THE INDUCTION PRINCIPLE, Journal of computer and system sciences (Print), 57(2), 1998, pp. 162-171
Authors:
BACH E
CONDON A
GLASER E
TANGUAY C
Citation: E. Bach et al., DNA MODELS AND ALGORITHMS FOR NP-COMPLETE PROBLEMS, Journal of computer and system sciences (Print), 57(2), 1998, pp. 172-186
Authors:
FEIGE U
KILIAN J
Citation: U. Feige et J. Kilian, ZERO-KNOWLEDGE AND THE CHROMATIC NUMBER, Journal of computer and system sciences (Print), 57(2), 1998, pp. 187-199
Authors:
CAUSSINUS H
MCKENZIE P
THERIEN D
VOLLMER H
Citation: H. Caussinus et al., NONDETERMINISTIC NC1 COMPUTATION, Journal of computer and system sciences (Print), 57(2), 1998, pp. 200-212
Authors:
VANMELKEBEEK D
Citation: D. Vanmelkebeek, DETERMINISTIC AND RANDOMIZED BOUNDED TRUTH-TABLE REDUCTIONS OF P, NL,AND L TO SPARSE SETS, Journal of computer and system sciences (Print), 57(2), 1998, pp. 213-232
Authors:
GABOW HN
Citation: Hn. Gabow, 27TH ANNUAL ACM SYMPOSIUM ON THE THEORY OF COMPUTING (STOC95) - MAY 29 JUNE 1, 1995 - FOREWORD, Journal of computer and system sciences (Print), 57(1), 1998, pp. 1-1
Authors:
BEAME P
COOK S
EDMONDS J
IMPAGLIAZZO R
PITASSI T
Citation: P. Beame et al., THE RELATIVE COMPLEXITY OF NP SEARCH PROBLEMS, Journal of computer and system sciences (Print), 57(1), 1998, pp. 3-19
Authors:
DIACONIS P
SALOFFCOSTE L
Citation: P. Diaconis et L. Saloffcoste, WHAT DO WE KNOW ABOUT THE METROPOLIS ALGORITHM, Journal of computer and system sciences (Print), 57(1), 1998, pp. 20-36
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
Authors:
KAVRAKI LE
LATOMBE JC
MOTWANI R
RAGHAVAN P
Citation: Le. Kavraki et al., RANDOMIZED QUERY-PROCESSING IN ROBOT PATH PLANNING, Journal of computer and system sciences (Print), 57(1), 1998, pp. 50-60
Authors:
KLEINBERG J
TARDOS E
Citation: J. Kleinberg et E. Tardos, APPROXIMATIONS FOR THE DISJOINT PATHS PROBLEM IN HIGH-DIAMETER PLANARNETWORKS, Journal of computer and system sciences (Print), 57(1), 1998, pp. 61-73
Authors:
ANDERSSON A
HAGERUP T
NILSSON S
RAMAN R
Citation: A. Andersson et al., SORTING IN LINEAR-TIME, Journal of computer and system sciences (Print), 57(1), 1998, pp. 74-93
Authors:
HENZINGER TA
KOPKE PW
PURI A
VARAIYA P
Citation: Ta. Henzinger et al., WHATS DECIDABLE ABOUT HYBRID AUTOMATA, Journal of computer and system sciences (Print), 57(1), 1998, pp. 94-124
Authors:
ILIE L
SALOMAA A
Citation: L. Ilie et A. Salomaa, 2-TESTABILITY AND RELABELINGS PRODUCE EVERYTHING, Journal of computer and system sciences (Print), 56(3), 1998, pp. 253-262
Authors:
BERG C
ULFBERG S
Citation: C. Berg et S. Ulfberg, A LOWER-BOUND FOR PERCEPTRONS AND AN ORACLE SEPARATION OF THE PPPH HIERARCHY, Journal of computer and system sciences (Print), 56(3), 1998, pp. 263-271
Authors:
SHARMA A
Citation: A. Sharma, A NOTE ON BATCH AND INCREMENTAL LEARNABILITY, Journal of computer and system sciences (Print), 56(3), 1998, pp. 272-276
Authors:
BENDAVID S
DICHTERMAN E
Citation: S. Bendavid et E. Dichterman, LEARNING WITH RESTRICTED FOCUS OF ATTENTION, Journal of computer and system sciences (Print), 56(3), 1998, pp. 277-298
Authors:
MALVESTUTO FM
MOSCARINI M
Citation: Fm. Malvestuto et M. Moscarini, A FAST ALGORITHM FOR QUERY OPTIMIZATION IN UNIVERSAL-RELATION DATABASES, Journal of computer and system sciences (Print), 56(3), 1998, pp. 299-309
Authors:
BSHOUTY N
HELLERSTEIN L
Citation: N. Bshouty et L. Hellerstein, ATTRIBUTE-EFFICIENT LEARNING IN QUERY AND MISTAKE-BOUND MODELS, Journal of computer and system sciences (Print), 56(3), 1998, pp. 310-319
Authors:
CHEN L
Citation: L. Chen, OPTIMAL CIRCULAR-ARC REPRESENTATIONS - PROPERTIES, RECOGNITION, AND CONSTRUCTION, Journal of computer and system sciences (Print), 56(3), 1998, pp. 320-331
Authors:
ENGELFRIET J
VOGLER H
Citation: J. Engelfriet et H. Vogler, THE EQUIVALENCE OF BOTTOM-UP AND TOP-DOWN TREE-TO-GRAPH TRANSDUCERS, Journal of computer and system sciences (Print), 56(3), 1998, pp. 332-356
Authors:
SHAPIRE RE
Citation: Re. Shapire, 8TH ANNUAL WORKSHOP ON COMPUTATIONAL LEARNING-THEORY (COLT) - JULY 5-8, 1995 - GUEST EDITORS FOREWORD, Journal of computer and system sciences (Print), 56(2), 1998, pp. 131-131