AAAAAA
Results: 26-50/82
Authors:
Kapron, BM
Citation: Bm. Kapron, Feasibly continuous type-two functionals, COMP COMPLE, 8(2), 1999, pp. 188-201
Authors:
Berg, C
Ulfberg, S
Citation: C. Berg et S. Ulfberg, Symmetric approximation arguments for monotone lower bounds without sunflowers, COMP COMPLE, 8(1), 1999, pp. 1-20
Authors:
Kremer, I
Nisan, N
Ron, D
Citation: I. Kremer et al., On randomized one-round communication complexity, COMP COMPLE, 8(1), 1999, pp. 21-49
Authors:
Goldreich, O
Petrank, E
Citation: O. Goldreich et E. Petrank, Quantifying knowledge complexity, COMP COMPLE, 8(1), 1999, pp. 50-98
Authors:
GROLMUSZ V
Citation: V. Grolmusz, CIRCUITS AND MULTIPARTY PROTOCOLS, Computational complexity, 7(1), 1998, pp. 1-18
Authors:
AIZENSTEIN H
HEGEDUS T
HELLERSTEIN L
PITT L
Citation: H. Aizenstein et al., COMPLEXITY THEORETIC HARDNESS RESULTS FOR QUERY LEARNING, Computational complexity, 7(1), 1998, pp. 19-53
Authors:
GRANDJEAN E
OLIVE F
Citation: E. Grandjean et F. Olive, MONADIC LOGICAL DEFINABILITY OF NONDETERMINISTIC LINEAR-TIME, Computational complexity, 7(1), 1998, pp. 54-97
Authors:
Razborov, AA
Citation: Aa. Razborov, Lower bounds for the polynomial calculus, COMP COMPLE, 7(4), 1998, pp. 291-324
Authors:
Beame, P
Impagliazzo, R
Pitassi, T
Citation: P. Beame et al., Improved depth lower bounds for small distance connectivity, COMP COMPLE, 7(4), 1998, pp. 325-345
Authors:
Krause, M
Pudlak, P
Citation: M. Krause et P. Pudlak, Computing Boolean functions by polynomials and threshold circuits, COMP COMPLE, 7(4), 1998, pp. 346-370
Authors:
Glaister, I
Shallit, J
Citation: I. Glaister et J. Shallit, Automaticity III: Polynomial automaticity and context-free languages, COMP COMPLE, 7(4), 1998, pp. 371-387
Authors:
Grigoriev, D
Karpinski, R
Yao, AC
Citation: D. Grigoriev et al., An exponential lower bound on the size of algebraic decision trees for MAX, COMP COMPLE, 7(3), 1998, pp. 193-203
Authors:
Egidi, L
Citation: L. Egidi, A quantifier elimination for the theory of p-adic numbers, COMP COMPLE, 7(3), 1998, pp. 205-263
Authors:
Book, RV
Vollmer, H
Wagner, KW
Citation: Rv. Book et al., Probabilistic type-2 operators and "almost"-classes, COMP COMPLE, 7(3), 1998, pp. 265-289
Authors:
Tardos, G
Barrington, DAM
Citation: G. Tardos et Dam. Barrington, A lower bound on the MOD 6 degree of the or function, COMP COMPLE, 7(2), 1998, pp. 99-108
Authors:
Damm, C
Jukna, S
Sgall, J
Citation: C. Damm et al., Some bounds on multiparty communication complexity of pointer jumping, COMP COMPLE, 7(2), 1998, pp. 109-127
Authors:
Santha, M
Tan, S
Citation: M. Santha et S. Tan, Verifying the determinant in parallel, COMP COMPLE, 7(2), 1998, pp. 128-151
Authors:
Russell, A
Sundaram, R
Citation: A. Russell et R. Sundaram, Symmetric alternation captures BPP, COMP COMPLE, 7(2), 1998, pp. 152-162
Authors:
Crescenzi, P
Silvestri, R
Citation: P. Crescenzi et R. Silvestri, Sperner's lemma and robust machines, COMP COMPLE, 7(2), 1998, pp. 163-173
Authors:
Feigenbaum, J
Fortnow, L
Laplante, S
Naik, A
Citation: J. Feigenbaum et al., On coherence, random-self-reducibility, and self-correction, COMP COMPLE, 7(2), 1998, pp. 174-191
Authors:
SMOLENSKY R
Citation: R. Smolensky, WELL-KNOWN BOUND FOR THE VC-DIMENSION MADE EASY, Computational complexity, 6(4), 1997, pp. 299-300
Authors:
SHOUP V
SMOLENSKY R
Citation: V. Shoup et R. Smolensky, LOWER BOUNDS FOR POLYNOMIAL EVALUATION AND INTERPOLATION PROBLEMS, Computational complexity, 6(4), 1997, pp. 301-311
Authors:
CHANDRA AK
RAGHAVAN P
RUZZO WL
SMOLENSKY R
TIWARI P
Citation: Ak. Chandra et al., THE ELECTRICAL-RESISTANCE OF A GRAPH CAPTURES ITS COMMUTE AND COVER TIMES, Computational complexity, 6(4), 1997, pp. 312-340
Authors:
FEIGE U
Citation: U. Feige, COLLECTING COUPONS ON TREES, AND THE COVER TIME OF RANDOM-WALKS, Computational complexity, 6(4), 1997, pp. 341-356
Authors:
GRIGORIEV D
KARPINSKI M
AUFDERHEIDE FM
SMOLENSKY R
Citation: D. Grigoriev et al., A LOWER-BOUND FOR RANDOMIZED ALGEBRAIC DECISION TREES, Computational complexity, 6(4), 1997, pp. 357-375