Pages that link to "Item:Q2280178"
From MaRDI portal
The following pages link to Elementary net synthesis remains NP-complete even for extremely simple inputs (Q2280178):
Displaying 9 items.
- The synthesis problem for elementary net systems is NP-complete (Q1389765) (← links)
- The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs (Q2032841) (← links)
- Edge, event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable (Q2117174) (← links)
- On the parameterized complexity of the synthesis of Boolean nets with restricted place environments (Q2235733) (← 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)
- Narrowing down the hardness barrier of synthesizing elementary net systems (Q5009430) (← 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)