Pages that link to "Item:Q671626"
From MaRDI portal
The following pages link to Negation-limited circuit complexity of symmetric functions (Q671626):
Displaying 10 items.
- Negation-limited formulas (Q729897) (← links)
- Negation-limited complexity of parity and inverters (Q1022345) (← links)
- On the minimum number of negations leading to super-polynomial savings (Q1029051) (← links)
- The complexity of computing symmetric functions using threshold circuits (Q1193637) (← 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)
- (Q3360126) (← links)
- ON THE COMPLEXITY OF CIRCUITS IN BASES CONTAINING MONOTONE ELEMENTS WITH ZERO WEIGHTS (Q5150707) (← links)