Author： Jukna S.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.290, Iss.3, 2003-01, pp. : 1851-1867
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
On BPP versus NP&unknown;coNP for ordered read-once branching programs
By Ablayev
Theoretical Computer Science, Vol. 264, Iss. 1, 2001-08 ,pp. :
Access to resources
Recommend
Time–Space Tradeoffs for Branching Programs
By Beame P. Jayram T.S. Saks M.
Journal of Computer and System Sciences, Vol. 63, Iss. 4, 2001-12 ,pp. :
A lower bound on branching programs reading some bits twice
By Savicky P. Zak S.
Theoretical Computer Science, Vol. 172, Iss. 1, 1997-02 ,pp. :
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. :