This paper presents a general reduction scheme for the NP-hardness of boolean net synthesis and identifies 67 new types with a hard synthesis problem. 1 ...

This paper presents a general reduction scheme for the NP-hardness of boolean net synthesis and identifies 67 new types with a hard synthesis problem.

Vol-2371/paper05⫷Vol-2371/paper06⫸Vol-2371/paper07. Ronny Tredup Christian Rosenke. On the Hardness of Synthesizing Boolean Nets.

Bibliographic details on On the Hardness of Synthesizing Boolean Nets.

Connected Papers is a visual tool to help researchers and applied scientists find academic papers relevant to their field of work.

Jul 24, 2020 · We demonstrate the W[2]-hardness of d-restricted synthesis for these types, which makes a clear distinction to the earlier results. Page 3 ...

Oct 12, 2021 · In this paper, we enhance our understanding of τ-SOBNWRD from a parameterized point of view: We show for 27 of the 128 thinkable Boolean types ...

In this work, we study the complexity of synthesis for Boolean nets [3, pp. 139-152], where each place contains at most one token, for any reachable marking. A ...

In this paper, we first show that unless some hard conjectures in complexity theory are falsified, Boolean functional synthesis must generate large Skolem ...

The main result is a general proof scheme that identifies 77 NP-hard cases and all remaining 51 classes are shown to be synthesizable in polynomial time ...