AAAAAA
Results:
1-10
|
Results: 10
Authors:
BEIGEL R
GASARCH B
LI M
ZHANG LX
Citation: R. Beigel et al., ADDITION IN LOG(2) N- A SIMPLE ANALYSIS(O(1) STEPS ON AVERAGE ), Theoretical computer science, 191(1-2), 1998, pp. 245-248
Authors:
BEIGEL R
GOLDSMITH J
Citation: R. Beigel et J. Goldsmith, DOWNWARD SEPARATION FAILS CATASTROPHICALLY FOR LIMITED NONDETERMINISMCLASSES, SIAM journal on computing, 27(5), 1998, pp. 1420-1429
Authors:
BEIGEL R
MACIEL A
Citation: R. Beigel et A. Maciel, UPPER AND LOWER BOUNDS FOR SOME DEPTH-3 CIRCUIT CLASSES, Computational complexity, 6(3), 1997, pp. 235-255
Authors:
BEIGEL R
TAMASSIA R
Citation: R. Beigel et R. Tamassia, 26TH ANNUAL ACM SYMPOSIUM ON THE THEORY OF COMPUTING (STOC94) - MAY 23-25, 1994 - GUEST EDITORS FOREWORD, Journal of computer and system sciences, 55(1), 1997, pp. 1-1
Authors:
BEIGEL R
GASARCH W
KINBER E
Citation: R. Beigel et al., FREQUENCY COMPUTATION AND BOUNDED QUERIES, Theoretical computer science, 163(1-2), 1996, pp. 177-192
Authors:
BEIGEL R
KUMMER M
STEPHAN F
Citation: R. Beigel et al., APPROXIMABLE SETS, Information and computation, 120(2), 1995, pp. 304-314
Authors:
BEIGEL R
KUMMER M
STEPHAN F
Citation: R. Beigel et al., QUANTIFYING THE AMOUNT OF VERBOSENESS, Information and computation, 118(1), 1995, pp. 73-90
Authors:
BEIGEL R
REINGOLD N
SPIELMAN D
Citation: R. Beigel et al., PP IS CLOSED UNDER INTERSECTION, Journal of computer and system sciences, 50(2), 1995, pp. 191-202
Authors:
ALLENDER E
BEIGEL R
HERTRAMPF U
HOMER S
Citation: E. Allender et al., ALMOST-EVERYWHERE COMPLEXITY HIERARCHIES FOR NONDETERMINISTIC TIME, Theoretical computer science, 115(2), 1993, pp. 225-241
Authors:
BEIGEL R
CHANG R
OGIWARA M
Citation: R. Beigel et al., A RELATIONSHIP BETWEEN DIFFERENCE HIERARCHIES AND RELATIVIZED POLYNOMIAL HIERARCHIES, Mathematical systems theory, 26(3), 1993, pp. 293-310
Risultati:
1-10
|