The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
1994, volume: 133, number: 1

  1. Felipe Cucker, Mike Shub, Steve Smale
    Separation of Complexity Classes in Koiran's Weak Model. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:133, n:1, pp:3-14 [Journal]
  2. T. Emerson
    Relativizations of the P=?NP Question over the Reals (and other Ordered Rings). [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:133, n:1, pp:15-22 [Journal]
  3. Dima Grigoriev
    Deviation Theorems for Solutions of Differential Equations and Applications to Lower Bounds on Parallel Complexity of Sigmoids. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:133, n:1, pp:23-33 [Journal]
  4. Pascal Koiran
    Computing over the Reals with Addition and Order. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:133, n:1, pp:35-47 [Journal]
  5. Petr Kurka
    Regular Unimodal Systems and Factors of Finite Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:133, n:1, pp:49-64 [Journal]
  6. Gregorio Malajovich
    On Generalized Newton Algorithms: Quadratic Convergence, Path-Following and Error Analysis. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:133, n:1, pp:65-84 [Journal]
  7. Klaus Meer
    On the Complexity of Quadratic Programming in Real Number Models of Computation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:133, n:1, pp:85-84 [Journal]
  8. Christian Michaux
    P != NP over the Nonstandard Reals Implies P != NP over R. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:133, n:1, pp:95-104 [Journal]
  9. J. Maurice Rojas
    A Convex Geometric Approach to Counting the Roots of a Polynomial System. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:133, n:1, pp:105-140 [Journal]
  10. Mike Shub, Steve Smale
    Complexity of Bezout's Theorem V: Polynomial Time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:133, n:1, pp:141-164 [Journal]
  11. Jan Verschelde, Ann Haegemans
    Homotopies for Solving Polynomial Systems Within a Bounded Domain. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:133, n:1, pp:165-185 [Journal]
  12. Mike Paterson
    David Michael Ritchie Park (1935-1990) in Memoriam. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:133, n:1, pp:187-200 [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