Shrinkage of de Morgan formulae under restriction

Michael S. Paterson, Uri Zwick

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

It is shown that a random restriction leaving only a fraction ε of the input variables unassigned reduces the expected de Morgan formula size of the induced function by a factor of O(ε1.63). This is an improvement over previous results. The new exponent yields an increased lower bound of approximately n2.63 for the de Morgan formula size of a function in P defined by A. E. Andreev (1987). This is the largest lower bound known, even for functions in NP.

Original languageEnglish
Title of host publicationAnnual Symposium on Foundations of Computer Science (Proceedings)
PublisherPubl by IEEE
Pages324-333
Number of pages10
ISBN (Print)0818624450
StatePublished - Dec 1991
EventProceedings of the 32nd Annual Symposium on Foundations of Computer Science - San Juan, PR, USA
Duration: 1 Oct 19914 Oct 1991

Publication series

NameAnnual Symposium on Foundations of Computer Science (Proceedings)
ISSN (Print)0272-5428

Conference

ConferenceProceedings of the 32nd Annual Symposium on Foundations of Computer Science
CitySan Juan, PR, USA
Period1/10/914/10/91

Cite this