The SCEAS System
Navigation Menu

Journals in DBLP

Computational Complexity
1993, volume: 3, number:

  1. 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]
  2. Stephen A. Cook, Patrick W. Dymond
    Parallel Pointer Machines. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1993, v:3, n:, pp:19-30 [Journal]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002