The following pages link to (Q5557960):
Displaying 11 items.
- Lower bounds for constant-depth circuits in the presence of help bits (Q917289) (← links)
- On the minimum number of negations leading to super-polynomial savings (Q1029051) (← links)
- Non-cancellative Boolean circuits: A generalization of monotone boolean circuits (Q1566723) (← 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)
- Exact value of the nonmonotone complexity of Boolean functions (Q2313604) (← links)
- Circuit complexity of \(k\)-valued logic functions in one infinite basis (Q2319830) (← 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)
- Improvement of nonmonotone complexity estimates of \(k\)-valued logic functions (Q6114318) (← links)
- Non-cancellative Boolean circuits: a generalization of monotone Boolean circuits (Q6567780) (← links)
