Author： Savicky P. Zak S.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.172, Iss.1, 1997-02, pp. : 293-301
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
On uncertainty versus size in branching programs
By Jukna S.
Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. :
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. :
Some results on tries with adaptive branching
By Reznik Y.A.
Theoretical Computer Science, Vol. 289, Iss. 2, 2002-10 ,pp. :
Lower bound for scalable Byzantine Agreement
By Holtby Dan
Distributed Computing, Vol. 21, Iss. 4, 2008-10 ,pp. :