Author： Baeza-Yates R.A.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.168, Iss.1, 1996-11, pp. : 21-38
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Pushdown automata with bounded nondeterminism and bounded ambiguity
By Herzog C.
Theoretical Computer Science, Vol. 181, Iss. 1, 1997-07 ,pp. :
Access to resources
Recommend
Heap-Bounded Assembly Language
By Aspinall David Compagnoni Adriana
Journal of Automated Reasoning, Vol. 31, Iss. 3-4, 2003-11 ,pp. :
Reversibility in space-bounded computation
International Journal of General Systems, Vol. 43, Iss. 7, 2014-10 ,pp. :
The bounded-complete hull of an -space
By Ershov Y.L.
Theoretical Computer Science, Vol. 175, Iss. 1, 1997-03 ,pp. :
On resource-bounded instance complexity
Theoretical Computer Science, Vol. 161, Iss. 1, 1996-07 ,pp. :