More on the complexity of negation-limited circuits

Authors:
Robert Beals;Tetsuro Nishino;Keisuke Tanaka
Affiliations:
School of Mathematics, Institute for Advanced Study, Princeton, NJ and DIMACS, Rutgers University, P.O. Box 1179, Piscataway, NJ;Department of Communications and Systems Engineering, The University of Electro-Communications, Chofu-shi, Tokyo 182, Japan;School of Information Science, Japan Advanced Institute of Science and Technology-Hokuriku, Tatsunokuchi, Ishikawa 92312, Japan
Venue:
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Year:
1995

Negation is powerless for Boolean slice functions

SIAM Journal on Computing
The monotone circuit complexity of Boolean functions

Combinatorica
The complexity of Boolean functions

The complexity of Boolean functions
The complexity of finite functions

Handbook of theoretical computer science (vol. A)
Communication networks

Handbook of theoretical computer science (vol. A)
Monotone circuits for matching require linear depth

Journal of the ACM (JACM)
Limiting negations in constant depth circuits

SIAM Journal on Computing
On the complexity of negation-limited Boolean networks

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the Inversion Complexity of a System of Functions

Journal of the ACM (JACM)
Hauptvortrag: The complexity of negation-limited networks - A brief survey

Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
An 0(n log n) sorting network

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

On the negation-limited circuit complexity of merging

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
On the negation-limited circuit complexity of sorting and inverting k-tonic sequences

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics

Hi-index	0.00