Pages that link to "Item:Q2235733"
From MaRDI portal
The following pages link to On the parameterized complexity of the synthesis of Boolean nets with restricted place environments (Q2235733):
Displaying 4 items.
- The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs (Q2032841) (← links)
- Synthesis of Petri nets with restricted place-environments: classical and parameterized (Q2117176) (← links)
- On the parameterized complexity of synthesizing Boolean Petri nets with restricted dependency (Q5019696) (← links)
- On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets (Q6070613) (← links)