External Links

    Journal: Theory Comput. Syst.

    Volume 27, Issue 3

    189 -- 200Mitsunori Ogiwara. Generalized Theorems on Relationships Among Reducibility Notions to Certain Complexity Classes
    201 -- 209Ronald V. Book, Jack H. Lutz, Klaus W. Wagner. An Observation on Probability Versus Randomness with Applications to Complexity Classes
    211 -- 229Osamu Watanabe. A Framework for Polynomial-Time Query Learnability
    231 -- 256Osamu Watanabe, Ricard Gavaldà. Structural Analysis of Polynomial-Time Query Learnability
    257 -- 273Dieter Kratsch, Lane A. Hemaspaandra. On the Complexity of Graph Reconstruction
    275 -- 282Daniel Berend, Christiane Frougny. Computability by Finite Automata and Pisot Bases
    runs on