Title of article
Reduced Error Pruning of branching programs cannot be approximated to within a logarithmic factor
Author/Authors
Richard Nock، نويسنده , , Tapio Elomaa، نويسنده , , Matti K??ri?inen، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2003
Pages
6
From page
73
To page
78
Keywords
Algorithms , Reduced Error Pruning , Branching program , Inapproximability
Journal title
Information Processing Letters
Serial Year
2003
Journal title
Information Processing Letters
Record number
129743
Link To Document