Pages that link to "Item:Q5009430"

The following pages link to Narrowing down the hardness barrier of synthesizing elementary net systems (Q5009430):

Displaying 7 items.

• The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs (Q2032841) (← links)
• On the parameterized complexity of the synthesis of Boolean nets with restricted place environments (Q2235733) (← links)
• Elementary net synthesis remains NP-complete even for extremely simple inputs (Q2280178) (← links)
• The complexity of synthesizing elementary net systems relative to natural parameters (Q2304629) (← links)
• Parameterized Complexity of Synthesizing b-Bounded (m, n)-T-Systems (Q3297771) (← links)
• On the parameterized complexity of synthesizing Boolean Petri nets with restricted dependency (Q5019696) (← links)
• The Complexity of Synthesis of b-Bounded Petri Nets (Q5025061) (← links)