Linear-size log-depth negation-limited inverter for \(k\)-tonic binary sequences
From MaRDI portal
Publication:1007246
DOI10.1016/j.tcs.2008.10.030zbMath1171.68014OpenAlexW2174212315MaRDI QIDQ1007246
Publication date: 20 March 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.10.030
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the negation-limited circuit complexity of merging
- Higher lower bounds on monotone size
- On the Inversion Complexity of a System of Functions
- On the Negation-Limited Circuit Complexity of Sorting and Inverting k-tonic Sequences
- On the Complexity of Negation-Limited Boolean Networks
- Negation-Limited Complexity of Parity and Inverters
- A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log n Negation Gates
This page was built for publication: Linear-size log-depth negation-limited inverter for \(k\)-tonic binary sequences