Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Richard Nock, Tapio Elomaa, Matti Kääriäinen. Reduced Error Pruning of branching programs cannot be approximated to within a logarithmic factor. Inf. Process. Lett., 87(2):73-78, 2003. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: The Difficulty of Reduced Error Pruning of Leveled Branching ProgramsTapio Elomaa, Matti Kääriäinen. amai 2002: [doi] The Difficulty of Reduced Error Pruning of Leveled Branching ProgramsTapio Elomaa, Matti Kääriäinen. isaim 2004: [doi] The Difficulty of Reduced Error Pruning of Leveled Branching ProgramsTapio Elomaa, Matti Kääriäinen. AMAI, 41(1):111-124, 2004. [doi]
The following publications are possibly variants of this publication: