The SCEAS System
Navigation Menu

Journals in DBLP

Mathematical Systems Theory
1994, volume: 27, number: 3

  1. Mitsunori Ogiwara
    Generalized Theorems on Relationships Among Reducibility Notions to Certain Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1994, v:27, n:3, pp:189-200 [Journal]
  2. Ronald V. Book, Jack H. Lutz, Klaus W. Wagner
    An Observation on Probability Versus Randomness with Applications to Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1994, v:27, n:3, pp:201-209 [Journal]
  3. Osamu Watanabe
    A Framework for Polynomial-Time Query Learnability. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1994, v:27, n:3, pp:211-229 [Journal]
  4. Osamu Watanabe, Ricard Gavaldà
    Structural Analysis of Polynomial-Time Query Learnability. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1994, v:27, n:3, pp:231-256 [Journal]
  5. Dieter Kratsch, Lane A. Hemaspaandra
    On the Complexity of Graph Reconstruction. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1994, v:27, n:3, pp:257-273 [Journal]
  6. Daniel Berend, Christiane Frougny
    Computability by Finite Automata and Pisot Bases. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1994, v:27, n:3, pp:275-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