Shallow circuits and concise formulae for multiple addition and multiplication Michael PatersonUri Zwick OriginalPaper Pages: 262 - 291
Finding maximal orders in semisimple algebras over Q Gábor IvanyosLajos Rónyai OriginalPaper Pages: 245 - 261
The relative power of logspace and polynomial time reductions Harry BuhrmanEdith SpaanLeen Torenvliet OriginalPaper Pages: 231 - 244
The alternation hierarchy for sublogarithmic space is infinite Burchard von BraunmühlRomain GenglerRobert Rettinger OriginalPaper Pages: 207 - 230
Relativized isomorphisms of NP-complete sets Judy GoldsmithDeborah Joseph OriginalPaper Pages: 186 - 205
Improving known solutions is hard Desh RanjanSuresh ChariPankaj Rohatgi OriginalPaper Pages: 168 - 185
Bounds on tradeoffs between randomness and communication complexity Ran CanettiOded Goldreich OriginalPaper Pages: 141 - 167
Exponential lower bounds for the pigeonhole principle Toniann PitassiPaul BeameRussell Impagliazzo OriginalPaper Pages: 97 - 140
On the efficiency of effective Nullstellensätze Marc GiustiJoos HeintzJuan Sabia OriginalPaper Pages: 56 - 95
Algorithmic aspects of Suslin's proof of Serre's conjecture Leandro CanigliaGuillermo CortiñasPablo Solernó OriginalPaper Pages: 31 - 55
On lower bounds for read-k-times branching programs A. BorodinA. RazborovR. Smolensky OriginalPaper Pages: 1 - 18
Non-deterministic exponential time has two-prover interactive protocols L. BabaiL. FortnowC. Lund Addendum Pages: 374 - 374
Randomized range-maxima in nearly-constant parallel time Omer BerkmanYossi MatiasUzi Vishkin OriginalPaper Pages: 350 - 373
Cartesian graph factorization at logarithmic cost per edge F. AurenhammerJ. HagauerW. Imrich OriginalPaper Pages: 331 - 349
Graph isomorphism is low for PP Johannes KöblerUwe SchöningJacobo Torán OriginalPaper Pages: 301 - 330
Majority gates vs. general weighted threshold gates Mikael GoldmannJohan HåstadAlexander Razborov OriginalPaper Pages: 277 - 300
Selection problems viaM-ary queries Katia S. GuimarãesWilliam I. GasarchJim Purtilo OriginalPaper Pages: 256 - 276
Fast exponentiation using the truncation operation Nader H. BshoutyYishay MansourPrasson Tiwari OriginalPaper Pages: 244 - 255
Algorithmic properties of maximal orders in simple algebras over Q Lajos Rónyai OriginalPaper Pages: 225 - 243
Computing Frobenius maps and factoring polynomials Joachim von zur GathenVictor Shoup OriginalPaper Pages: 187 - 224
Counting connected components of a semialgebraic set in subexponential time D. Yu. Grigor'evN. N. Vorobjov Jr. OriginalPaper Pages: 133 - 186
Improved low-density subset sum algorithms Matthijs J. CosterAntoine JouxJacques Stern OriginalPaper Pages: 111 - 128
A new recursion-theoretic characterization of the polytime functions Spephen BellantoniStephen Cook OriginalPaper Pages: 97 - 110
Efficient randomized generation of optimal algorithms for multiplication in certain finite fields Mohammad A. Shokrollahi OriginalPaper Pages: 67 - 96
The quantifier structure of sentences that characterize nondeterministic time complexity James F. Lynch OriginalPaper Pages: 40 - 66
Polynomial-time compression Judy GoldsmithKenneth KunenLane A. Hemachandra OriginalPaper Pages: 18 - 39
On being incoherent without being very hard Richard BeigelJoan Feigenbaum OriginalPaper Pages: 1 - 17
Efficient and optimal exponentiation in finite fields Joachim von zur Gathen OriginalPaper Pages: 360 - 394
NC1: The automata-theoretic viewpoint Pierre McKenziePierre PéladeauDenis Therien OriginalPaper Pages: 330 - 359
Randomized vs. deterministic decision tree complexity for read-once Boolean functions Rafi HeimanAvi Wigderson OriginalPaper Pages: 311 - 329
Three ∑ P 2 -complete problems in computational learning theory Ker-I KoWen-Guey Tzeng OriginalPaper Pages: 269 - 310
Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs Michael D. Hirsch OriginalPaper Pages: 257 - 268
Existence and efficient construction of fast Fourier transforms on supersolvable groups Ulrich Baum OriginalPaper Pages: 235 - 256
Decomposition of algebras over finite fields and number fields Wayne Eberly OriginalPaper Pages: 183 - 210
Some computational problems in linear algebra as hard as matrix multiplication Peter BürgisserMarek KarpinskiThomas Lickteig OriginalPaper Pages: 131 - 155
On the power of small-depth threshold circuits Johan HåstadMikael Goldmann OriginalPaper Pages: 113 - 129
Towards optimal simulations of formulas by bounded-width programs Richard Cleve OriginalPaper Pages: 91 - 105
On the decidability of sparse univariate polynomial interpolation Allan BorodinPrasoon Tiwari OriginalPaper Pages: 67 - 90
Arithmetization: A new method in structural complexity theory László BabaiLance Fortnow OriginalPaper Pages: 41 - 66
Non-deterministic exponential time has two-prover interactive protocols László BabaiLance FortnowCarsten Lund OriginalPaper Pages: 3 - 40
