The complexity of the label-splitting-problem for flip-flop-nets

DOI10.1007/978-3-030-61739-4_10OpenAlexW3097407479MaRDI QIDQ2039970

Ronny Tredup

Publication date: 6 July 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-61739-4_10

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets

This page was built for publication: The complexity of the label-splitting-problem for flip-flop-nets