Author： Bollig B. Sauerhoff M. Sieling D. Wegener I.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.205, Iss.1, 1998-08, pp. : 45-60
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
A read-once lower bound and a (1,+k)-hierarchy for branching programs
By Savicky P. Zak
Theoretical Computer Science, Vol. 238, Iss. 1, 2000-05 ,pp. :
Access to resources
Recommend
Query learning of bounded-width OBDDs
By Nakamura A.
Theoretical Computer Science, Vol. 241, Iss. 1, 2000-06 ,pp. :
K-center and K-median problems in graded distances
Theoretical Computer Science, Vol. 207, Iss. 1, 1998-10 ,pp. :
Call control with k rejections
By Sai Anand R. Erlebach T. Hall A. Stefanakos S.
Journal of Computer and System Sciences, Vol. 67, Iss. 4, 2003-12 ,pp. :