Your search returned 4 results.

Results
	1.	Turing machines with sublogarithmic space /Andrzej Szepietowski by Szepietowski, Andrez Series: Lecture Notes in Computer Science, 843 Material type: Book Publication details: Berlin S-V 1994 Availability: Items available for reference: Computer Science and Automation: Not for loan (1)Call number: 004.015113 N94.
	2.	Computability,enumerability, unsolvability directions in recursion theory ed. by S. B. Cooper, T. A. Slaman and S. S. Wainer by Slaman, T.A., ed Cooper, S.B., ed wainer, S.S., ed Series: London mathematical society lecture note series V.224 Material type: Book Publication details: Cambridge Cambridge University Press 1996 Availability: Items available for reference: Supercomputer Education and Research Centre: Not for loan (1)Call number: 511.3 N96.
	3.	Concrete complexity theory studies of the impact of the capabilities of the storage device on the efficiency of computations by Martin Huhne by Huhne, Martin Material type: Book Publication details: Dortmund Shaker Verlag 1996 Availability: Items available for reference: JRD Tata Memorial Library: Not for loan (1)Call number: 004.0151 N96.
	4.	Complexity theory exploring the limits of efficient algorithms by Ingo Wegener by Wegener, Ingo Material type: Book Publication details: Heidelberg Springer 2005 Availability: Items available for loan: JRD Tata Memorial Library (1)Call number: 511.3 P05. Place hold

Refine your search