Shrinkage of de Morgan formulae under restriction

@article{Paterson1991ShrinkageOD,
  title={Shrinkage of de Morgan formulae under restriction},
  author={Mike Paterson and Uri Zwick},
  journal={[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science},
  year={1991},
  pages={324-333}
}
It is shown that a random restriction leaving only a fraction in of the input variables unassigned reduces the expected de Morgan formula size of the induced function by a factor of O( in /sup 1.63/). This is an improvement over previous results. The new exponent yields an increased lower bound of approximately n/sup 2.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.<<ETX>> 

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 45 CITATIONS

How Do Read-Once Formulae Shrink?

  • Combinatorics, Probability & Computing
  • 1994
VIEW 6 EXCERPTS
CITES BACKGROUND

Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases

  • Electronic Colloquium on Computational Complexity
  • 2015
VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

An Improved Deterministic #SAT Algorithm for Small de Morgan Formulas

VIEW 9 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

On the Shrinkage Exponent for Read-Once Formulae

VIEW 4 EXCERPTS
CITES BACKGROUND & RESULTS
HIGHLY INFLUENCED

A Lower Bound for Interpolation

  • Logic Journal of the IGPL
  • 1997
VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

The Effect of Random Restrictions on Formula Size

  • Random Struct. Algorithms
  • 1993
VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

The shrinkage exponent is 2

  • Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science
  • 1993
VIEW 2 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Circuit Depth Reductions

  • Electronic Colloquium on Computational Complexity
  • 2018

References

Publications referenced by this paper.
SHOWING 1-10 OF 14 REFERENCES

The complexity of Boolean networks

P. E. Dunne
  • 1988
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Short Monotone Formulae for the Majority Function

  • J. Algorithms
  • 1984
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

An Extension of Khrapchenko's Theorem

  • Inf. Process. Lett.
  • 1991
VIEW 1 EXCERPT

Shrinkage of de Morgan formulae under restriction

M. S. Paterson, U. Zwick
  • Proc. 32nd Annual IEEE Symposium on Foundations of Computer Science
  • 1991
VIEW 1 EXCERPT

The complexity of Boolean functions

I. Wegener
  • Wiley-Teubner Series in Computer Science,
  • 1987
VIEW 1 EXCERPT