Generalized theorems on relationships among reducibility notions to certain complexity classes Mitsunori Ogiwara OriginalPaper Pages: 189 - 200
An observation on probability versus randomness with applications to complexity classes Ronald V. BookJack H. LutzKlaus W. Wagner OriginalPaper Pages: 201 - 209
Structural analysis of polynomial-time query learnability Osamu WatanabeRicard Gavaldà OriginalPaper Pages: 231 - 256
On the complexity of graph reconstruction Dieter KratschLane A. Hemaspaandra OriginalPaper Pages: 257 - 273
Computability by finite automata and pisot bases Daniel BerendChristiane Frougny OriginalPaper Pages: 275 - 282