Pages that link to "Item:Q2817595"
From MaRDI portal
The following pages link to On the complexity of negation-limited Boolean networks (preliminary version) (Q2817595):
Displaying 13 items.
- A curious new result in switching theory (Q582260) (← links)
- Negation-limited circuit complexity of symmetric functions (Q671626) (← links)
- Negation-limited formulas (Q729897) (← links)
- Complexity of limit-cycle problems in Boolean networks (Q831798) (← links)
- Negation-limited complexity of parity and inverters (Q1022345) (← 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)
- On the negation-limited circuit complexity of merging (Q1861565) (← links)
- Elementary net synthesis remains NP-complete even for extremely simple inputs (Q2280178) (← links)
- Limiting negations in bounded-depth circuits: an extension of Markov's theorem (Q2390211) (← links)
- On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets (Q6070613) (← links)
- Non-cancellative Boolean circuits: a generalization of monotone Boolean circuits (Q6567780) (← links)