Flip-Flop Nets

Schmitt V · 1996 · DOI 10.1007/3-540-60922-9

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

open at publisher browse 1 citing papers

representative citing papers

cs.CC · 2022-03-17 · unverdicted · novelty 6.0

Proves that most bounded-modification problems for making transition systems implementable by flip-flop nets are NP-complete.

Showing 1 of 1 citing paper.

On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets cs.CC · 2022-03-17 · unverdicted · none · ref 19
Proves that most bounded-modification problems for making transition systems implementable by flip-flop nets are NP-complete.