Pages that link to "Item:Q3254629"
From MaRDI portal
The following pages link to On the Inversion Complexity of a System of Functions (Q3254629):
Displaying 26 items.
- Cyclic Boolean circuits (Q442202) (← links)
- A curious new result in switching theory (Q582260) (← links)
- 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)
- Negation-limited complexity of parity and inverters (Q1022345) (← links)
- On the minimum number of negations leading to super-polynomial savings (Q1029051) (← links)
- Bounded queries to SAT and the Boolean hierarchy (Q1178690) (← links)
- Characteristic measures of switching functions (Q1243267) (← links)
- The learnability of exclusive-or expansions based on monotone DNF formulas (Q1575458) (← links)
- An exponential gap with the removal of one negation gate (Q1603543) (← 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)
- Limiting negations in bounded-depth circuits: an extension of Markov's theorem (Q2390211) (← links)
- Alternation, sparsity and sensitivity: bounds and exponential gaps (Q2632012) (← links)
- Lower bounds for Boolean circuits of bounded negation width (Q2672949) (← links)
- On the positive and the inversion complexity of Boolean functions (Q3142263) (← links)
- On Negation Complexity of Injections, Surjections and Collision-Resistance in Cryptography (Q3179494) (← links)
- On Negations in Boolean Networks (Q3644711) (← links)
- Testing \(k\)-monotonicity (Q4638079) (← links)
- (Q5009536) (← links)
- ON THE COMPLEXITY OF CIRCUITS IN BASES CONTAINING MONOTONE ELEMENTS WITH ZERO WEIGHTS (Q5150707) (← links)
- New bounds for energy complexity of Boolean functions (Q5918995) (← links)
- Improvement of nonmonotone complexity estimates of \(k\)-valued logic functions (Q6114318) (← links)
