The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
1996, volume: 157, number: 2

  1. Farid M. Ablayev
    Lower Bounds for One-Way Probabilistic Communication Complexity and Their Application to Space Complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:157, n:2, pp:139-159 [Journal]
  2. Dima Burago, Michel de Rougemont, Anatol Slissenko
    On the Complexity of Partially Observed Markov Decision Processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:157, n:2, pp:161-183 [Journal]
  3. Dima Grigoriev, Nicolai Vorobjov
    Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:157, n:2, pp:185-214 [Journal]
  4. Alexander V. Karzanov
    How to Tidy up a General Set-System by Use of Uncrossing Operations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:157, n:2, pp:215-225 [Journal]
  5. Andrei A. Muchnik, Nikolai K. Vereshchagin
    A General Method to Construct Oracles Realizing Given Relationships Between Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:157, n:2, pp:227-258 [Journal]
  6. Marek Karpinski, Igor Shparlinski
    On Some Approximation Problems Concerning Sparse Polynomials over Finite Fields. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:157, n:2, pp:259-266 [Journal]
  7. Leonid A. Levin
    Computational Complexity of Functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:157, n:2, pp:267-271 [Journal]
  8. Igor Shparlinski
    On Finding Primitive Roots in Finite Fields. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:157, n:2, pp:273-275 [Journal]
  9. Oleg Verbitsky
    Towards the Parallel Repetition Conjecture. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:157, n:2, pp:277-282 [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