The Difficulty of Reduced Error Pruning of Leveled Branching Programs

ISSN： 1012-2443

Source： Annals of Mathematics and Artificial Intelligence, Vol.41, Iss.1, 2004-05, pp. : 111-124

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On Error Bounds for Quasinormal Programs

By Minchenko L. Tarakanov A.

Journal of Optimization Theory and Applications, Vol. 148, Iss. 3, 2011-03 ,pp. : 571-579

Springer Publishing Company

Access to resources Recommend Favorite

Inductive Counting for Width-Restricted Branching Programs

By Damm C. Holzer M.

Information and Computation, Vol. 130, Iss. 1, 1996-10 ,pp. : 91-99

Academic Press

Access to resources Recommend Favorite

A lower bound on the computation complexity of characteristic functions for BCH-codes by branching programs

By Okol'nishnikova E.

Journal of Applied and Industrial Mathematics, Vol. 4, Iss. 2, 2010-04 ,pp. : 231-235

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

New smoothing SVM algorithm with tight error bound and efficient reduced techniques

By Zhou Shuisheng Cui Jiangtao Ye Feng Liu Hongwei Zhu Qiang

Computational Optimization and Applications, Vol. 56, Iss. 3, 2013-12 ,pp. : 599-617

Springer Publishing Company

Access to resources Recommend Favorite

Towards simplified and optimized a posteriori error estimation using PGD reduced models

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Vol. 113, Iss. 6, 2018-02 ,pp. : 967-998

John Wiley & Sons Inc

Access to resources Recommend Favorite