The following pages link to (Q4092993):
Displaying 17 items.
- Negation-limited circuit complexity of symmetric functions (Q671626) (← links)
- Negation-limited formulas (Q729897) (← links)
- Limiting negations in non-deterministic circuits (Q837192) (← links)
- Linear-size log-depth negation-limited inverter for \(k\)-tonic binary sequences (Q1007246) (← links)
- On the minimum number of negations leading to super-polynomial savings (Q1029051) (← links)
- Negation can be exponentially powerful (Q1143790) (← links)
- An exponential gap with the removal of one negation gate (Q1603543) (← links)
- Asymptotics of growth for non-monotone complexity of multi-valued logic function systems (Q1685402) (← links)
- The minimum number of negations in circuits for systems of multi-valued functions (Q1744290) (← links)
- On the negation-limited circuit complexity of merging (Q1861565) (← links)
- On the mystery of negations in circuits: structure vs power (Q2019505) (← links)
- Exact value of the nonmonotone complexity of Boolean functions (Q2313604) (← links)
- Limiting negations in bounded-depth circuits: an extension of Markov's theorem (Q2390211) (← links)
- On Negation Complexity of Injections, Surjections and Collision-Resistance in Cryptography (Q3179494) (← links)
- On Negations in Boolean Networks (Q3644711) (← links)
- On the Complexity of Multivalued Logic Functions over Some Infinite Basis (Q4553643) (← links)
- ON THE COMPLEXITY OF CIRCUITS IN BASES CONTAINING MONOTONE ELEMENTS WITH ZERO WEIGHTS (Q5150707) (← links)
