AAAAAA
Results: 1-25/82
Authors:
Harsha, P
Sudan, M
Citation: P. Harsha et M. Sudan, Small PCPs with low query complexity, COMP COMPLE, 9(3-4), 2000, pp. 157-201
Authors:
Kiwi, M
Lund, C
Spielman, D
Russell, A
Sundaram, R
Citation: M. Kiwi et al., Alternation in interaction, COMP COMPLE, 9(3-4), 2000, pp. 202-246
Authors:
Sieling, D
Citation: D. Sieling, A separation of syntactic and nonsyntactic (1,+k)-branching programs, COMP COMPLE, 9(3-4), 2000, pp. 247-263
Authors:
Blaser, M
Citation: M. Blaser, Lower bounds for the bilinear complexity of associative algebras, COMP COMPLE, 9(2), 2000, pp. 73-112
Authors:
Raz, R
Citation: R. Raz, The BNS-Chung criterion for multi-party communication complexity, COMP COMPLE, 9(2), 2000, pp. 113-122
Authors:
Alvarez, C
Greenlaw, R
Citation: C. Alvarez et R. Greenlaw, A compendium of problems complete for symmetric logarithmic space, COMP COMPLE, 9(2), 2000, pp. 123-145
Authors:
Blume, F
Citation: F. Blume, On the relation between entropy and the average complexity of trajectoriesin dynamical systems, COMP COMPLE, 9(2), 2000, pp. 146-155
Authors:
Paturi, R
Saks, ME
Zane, F
Citation: R. Paturi et al., Exponential lower bounds for depth three Boolean circuits, COMP COMPLE, 9(1), 2000, pp. 1-15
Authors:
Green, F
Citation: F. Green, A complex-number Fourier technique for lower bounds on the Mod-m degree, COMP COMPLE, 9(1), 2000, pp. 16-38
Authors:
Bernasconi, A
Damm, C
Shparlinski, I
Citation: A. Bernasconi et al., The average sensitivity of square-freeness, COMP COMPLE, 9(1), 2000, pp. 39-51
Authors:
Greenhill, C
Citation: C. Greenhill, The complexity of counting colourings and independent sets in sparse graphs and hypergraphs, COMP COMPLE, 9(1), 2000, pp. 52-72
Authors:
Baur, W
Halupczok, K
Citation: W. Baur et K. Halupczok, On lower bounds for the complexity of polynomials and their multiples, COMP COMPLE, 8(4), 1999, pp. 309-315
Authors:
Grigoriev, D
Citation: D. Grigoriev, Complexity lower bounds for randomized computation trees over zero characteristic fields, COMP COMPLE, 8(4), 1999, pp. 316-329
Authors:
Ivanov, S
de Rougemont, M
Citation: S. Ivanov et M. De Rougemont, Interactive protocols over the reals, COMP COMPLE, 8(4), 1999, pp. 330-345
Authors:
Ishihara, H
Citation: H. Ishihara, Function algebraic characterizations of the polytime functions, COMP COMPLE, 8(4), 1999, pp. 346-356
Authors:
Jukna, S
Razborov, A
Savicky, P
Wegener, I
Citation: S. Jukna et al., On P versus NP boolean AND co-NP for decision trees and read-once branching programs, COMP COMPLE, 8(4), 1999, pp. 357-370
Authors:
Dietzfelbinger, M
Huhne, M
Citation: M. Dietzfelbinger et M. Huhne, Matching upper and lower bounds for simulations of several linear tapes onone multidimensional tape, COMP COMPLE, 8(4), 1999, pp. 371-392
Authors:
Blaser, M
Citation: M. Blaser, Lower bounds for the multiplicative complexity of matrix multiplication, COMP COMPLE, 8(3), 1999, pp. 203-226
Authors:
Huang, MD
Wong, YC
Citation: Md. Huang et Yc. Wong, Solvability of systems of polynomial congruences modulo a large prime, COMP COMPLE, 8(3), 1999, pp. 227-257
Authors:
Barrington, DAM
Straubing, H
Citation: Dam. Barrington et H. Straubing, Lower bounds for modular counting by circuits with modular gates, COMP COMPLE, 8(3), 1999, pp. 258-272
Authors:
Liskiewicz, M
Reischuk, R
Citation: M. Liskiewicz et R. Reischuk, On small space complexity classes of stochastic turing machines and Arthur-Merlin-games, COMP COMPLE, 8(3), 1999, pp. 273-307
Authors:
Allender, E
Beals, R
Ogihara, M
Citation: E. Allender et al., The complexity of matrix rank and feasible systems of linear equations, COMP COMPLE, 8(2), 1999, pp. 99-126
Authors:
Impagliazzo, R
Pudlak, P
Sgall, J
Citation: R. Impagliazzo et al., Lower bounds for the polynomial calculus and the Grobner basis algorithm, COMP COMPLE, 8(2), 1999, pp. 127-144
Authors:
Blundo, C
De Santis, A
Persiano, G
Vaccaro, U
Citation: C. Blundo et al., Randomness complexity of private computation, COMP COMPLE, 8(2), 1999, pp. 145-168
Authors:
Naik, AV
Selman, AL
Citation: Av. Naik et Al. Selman, Adaptive versus nonadaptive queries to NP and P-selective sets, COMP COMPLE, 8(2), 1999, pp. 169-187