Nondeterminism and An Abstract Formulation of Nečiporuk’s Lower Bound MethodReport as inadecuate




Nondeterminism and An Abstract Formulation of Nečiporuk’s Lower Bound Method - Download this document for free, or read online. Document in PDF available to download.

1 University of Washington 2 ENS Cachan - École normale supérieure - Cachan 3 Université de Montréal Montréal 4 DAHU - Verification in databases LSV - Laboratoire Spécification et Vérification Cachan, ENS Cachan - École normale supérieure - Cachan, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8643

Abstract : A formulation of Nečiporuk-s lower bound method slightly more inclusive than the usual complexity-measure-specific formulation is presented. Using this general formulation, limitations to lower bounds achievable by the method are obtained for several computation models, such as branching programs and Boolean formulas having access to a sublinear number of nondeterministic bits. In particular, it is shown that any lower bound achievable by the method of Nečiporuk for the size of nondeterministic and parity branching programs is at most On^3-2 - log n.

Keywords : Branching programs binary formulas limited nondeterminism





Author: Paul Beame - Nathan Grosshans - Pierre Mckenzie - Luc Segoufin -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents