Recursion Theory and Complexity (Proceedings of the Kazan '97 Workshop, Kazan, Russia, July 14-19, 1997) || Polynomial-time versus computable Boolean algebras
Arslanov, Marat M., Lempp, SteffenVolume:
10.1515/97
Year:
1999
Language:
english
DOI:
10.1515/9783110807486.15
File:
PDF, 1.21 MB
english, 1999