Journals in DBLP
Allan Borodin , Alexander A. Razborov , Roman Smolensky On Lower Bounds for Read-K-Times Branching Programs. [Citation Graph (1, 0)][DBLP ] Computational Complexity, 1993, v:3, n:, pp:1-18 [Journal ] Stephen A. Cook , Patrick W. Dymond Parallel Pointer Machines. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1993, v:3, n:, pp:19-30 [Journal ] Leandro Caniglia , Guillermo Cortiñas , Silvia Danón , Joos Heintz , Teresa Krick , Pablo Solernó (Working Group Noaï Fitchas) Algorithmic Aspects of Suslin's Proof of Serre's Conjecture. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1993, v:3, n:, pp:31-55 [Journal ] Marc Giusti , Joos Heintz , Juan Sabia On the Efficiency of Effective Nullstellensätze. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1993, v:3, n:, pp:56-95 [Journal ] Toniann Pitassi , Paul Beame , Russell Impagliazzo Exponential Lower Bounds for the Pigeonhole Principle. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1993, v:3, n:, pp:97-140 [Journal ] Ran Canetti , Oded Goldreich Bounds on Tradeoffs Between Randomness and Communication Complexity. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1993, v:3, n:, pp:141-167 [Journal ] Desh Ranjan , Suresh Chari , Pankaj Rohatgi Improving Known Solutions is Hard. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1993, v:3, n:, pp:168-185 [Journal ] Judy Goldsmith , Deborah Joseph Relativized Isomorphisms of NP-Complete Sets. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1993, v:3, n:, pp:186-205 [Journal ] Burchard von Braunmühl , Romain Gengler , Robert Rettinger The Alternation Hierarchy for Sublogarithmic Space is Infinite. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1993, v:3, n:, pp:207-230 [Journal ] Harry Buhrman , Edith Spaan , Leen Torenvliet The Relative Power of Logspace and Polynomial Time Reductions. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1993, v:3, n:, pp:231-244 [Journal ] Gábor Ivanyos , Lajos Rónyai Finding Maximal Orders in Semisimple Algebras Over Q. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1993, v:3, n:, pp:245-261 [Journal ] Mike Paterson , Uri Zwick Shallow Circuits and Concise Formulae for Multiple Addition and Multiplication. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1993, v:3, n:, pp:262-291 [Journal ] Anne Condon The Complexity of the Max Word Problem and the Power of One-Way Interactive Proof Systems. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1993, v:3, n:, pp:292-305 [Journal ] László Babai , Lance Fortnow , Noam Nisan , Avi Wigderson BPP Has Subexponential Time Simulations Unless EXPTIME has Publishable Proofs. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1993, v:3, n:, pp:307-318 [Journal ] Mihir Bellare , Oded Goldreich , Shafi Goldwasser Randomness in Interactive Proofs. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1993, v:3, n:, pp:319-354 [Journal ] René Peralta , Victor Shoup Primality Testing with Fewer Random Bits. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1993, v:3, n:, pp:355-367 [Journal ] Eric Allender , Danilo Bruschi , Giovanni Pighizzini The Complexity of Computing Maximal Word Functions. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1993, v:3, n:, pp:368-391 [Journal ] Wolfgang Maass , Georg Schnitger , Endre Szemerédi , György Turán Two Tapes Versus One for Off-Line Turing Machines. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1993, v:3, n:, pp:392-401 [Journal ]