Entropy of Contact Circuits and Lower Bounds on Their Complexity

@article{Jukna1988EntropyOC,
  title={Entropy of Contact Circuits and Lower Bounds on Their Complexity},
  author={Stasys Jukna},
  journal={Theor. Comput. Sci.},
  year={1988},
  volume={57},
  pages={113-129}
}
A method for obtaining lower bounds on the contact citchlt complexity of explicitly defined Boolean functions is given. It appears as one of possible.concretixations of a more general “‘convolutional” approach to the lower bounds problem worked out by the author in 1984 [123. The method is based on an appropriate notion of “inner information” or “entropy” of finite objects (circuits, Boolean functions, etc.). Lower bounds on the complexity are obtained by means of entropy-preserving embeddings… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Lower bounds on the complexity of ltimeonly branching programs

L. Budach
Ptoc 15 th ACM STOC • 1983

Lov & z and C . Rackoff , Random walks , universal sequences and the complexity of maze problems , in : I ~ YX 20 th IEEE Symp

RM. Karp R AMums, L. R Lipton
1979

An exponential lower bound for oneMeonly branching proSrams

E. G. Valiant
Lecture Notes in Computer Science

PudlBk , A lower bound on the complexity of branching programs

P.
-1

Pulatov , Lower bounds on the complexity of implementation of characteristic functions of codes by =schemes

AK.
-1

Similar Papers

Loading similar papers…