TY - GEN
T1 - Shrinkage of de Morgan formulae under restriction
AU - Paterson, Michael S.
AU - Zwick, Uri
PY - 1991/12
Y1 - 1991/12
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0026384506&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:0026384506
SN - 0818624450
T3 - Annual Symposium on Foundations of Computer Science (Proceedings)
SP - 324
EP - 333
BT - Annual Symposium on Foundations of Computer Science (Proceedings)
PB - Publ by IEEE
T2 - Proceedings of the 32nd Annual Symposium on Foundations of Computer Science
Y2 - 1 October 1991 through 4 October 1991
ER -