Nondeterminism and An Abstract Formulation of Nečiporuk’s Lower Bound Method - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue ACM Transactions on Computation Theory Année : 2016

Nondeterminism and An Abstract Formulation of Nečiporuk’s Lower Bound Method

Résumé

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 O(n^(3/2) / log n).
Fichier principal
Vignette du fichier
main.pdf (776.08 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01426213 , version 1 (04-01-2017)

Licence

Copyright (Tous droits réservés)

Identifiants

Citer

Paul Beame, Nathan Grosshans, Pierre Mckenzie, Luc Segoufin. Nondeterminism and An Abstract Formulation of Nečiporuk’s Lower Bound Method. ACM Transactions on Computation Theory, 2016, 9 (1), pp.1-34. ⟨10.1145/3013516⟩. ⟨hal-01426213⟩
135 Consultations
110 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More