A Measure in Which Boolean Negation is Exponentially Powerful

Forfattere

  • Sven Skyum

DOI:

https://doi.org/10.7146/dpb.v11i154.7428

Resumé

The power of negation in combinatorial complexity theory has for a long time been an intriguing question. In this paper we demonstrate that in the more restricted setting of projections among families of Boolean functions, negation can be exponentially powerful.

Forfatterbiografi

Sven Skyum

Downloads

Publiceret

1982-09-01

Citation/Eksport

Skyum, S. (1982). A Measure in Which Boolean Negation is Exponentially Powerful. DAIMI Report Series, 11(154). https://doi.org/10.7146/dpb.v11i154.7428

Nummer

Nr. 154 (1982): PB-154 A Measure in Which Boolean Negation is Exponentially Powerful

Sektion

Articles

Licens

Creative Commons License

Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.