Proves that most bounded-modification problems for making transition systems implementable by flip-flop nets are NP-complete.
Polynomial Al gorithms for the Synthesis of Bounded Nets
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2022 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets
Proves that most bounded-modification problems for making transition systems implementable by flip-flop nets are NP-complete.