The complexity of finite functions
Handbook of theoretical computer science (vol. A)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
On the Complexity of Negation-Limited Boolean Networks
SIAM Journal on Computing
On the Inversion Complexity of a System of Functions
Journal of the ACM (JACM)
Higher lower bounds on monotone size
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On the negation-limited circuit complexity of merging
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Hauptvortrag: The complexity of negation-limited networks - A brief survey
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
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
Negation-Limited complexity of parity and inverters
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
| Hi-index | 5.23 |
In negation-limited complexity, one considers circuits with a limited number of NOT gates, being motivated by the gap in our understanding of monotone versus general circuit complexity. In this context, the study of inverters, i.e., circuits with inputs x"1,...,x"n and outputs @?x"1,...,@?x"n, is fundamental since an inverter with r NOTs can be used to convert a general circuit to one with only r NOTs. Beals, Nishino, and Tanaka [R. Beals, T. Nishino, K. Tanaka, On the complexity of negation-limited Boolean networks, SIAM Journal on Computing 27 (5) (1998) 1334-1347. A preliminary version appears in: Proceedings of STOC95: The 27th Annual ACM Symposium on Theory of Computing, 1995, pp. 585-595] gave a construction of an n-inverter with size O(nlogn), depth O(logn), and @?log"2(n+1)@? NOTs. A zero-one sequence x"1,...,x"n is k-tonic if the number of i's such that x"ix"i"+"1 is at most k. The notion generalizes well-known bitonic sequences. We give a construction of circuits inverting k-tonic sequences with size O((logk)n) and depth O(logkloglogn+logn) using log"2n+log"2log"2log"2n+O(1) NOTs. In particular, for the case where k=O(1), our k-tonic inverter achieves asymptotically optimal linear size and logarithmic depth. Our construction improves all the parameters of the k-tonic inverter by Sato, Amano, and Maruoka [T. Sato, K. Amano, A. Maruoka, On the negation-limited circuit complexity of sorting and inverting k-tonic sequences, in: Proceedings of COCOON06: The 12th Annual International Computing and Combinatorics Conference, in: Lecture Notes in Computer Science, vol. 4112, 2006, pp. 104-115]. We also give a construction of k-tonic sorters achieving linear size and logarithmic depth with log"2log"2n+log"2log"2log"2n+O(1) NOT gates for the case where k=O(1). The following question by Turan remains open: Is the size of any depth-O(logn) inverter with O(logn) NOT gates superlinear?