On the parameterized complexity of \(d\)-restricted Boolean net synthesis

DOI10.1007/978-3-030-59267-7_20OpenAlexW3092627281MaRDI QIDQ2110713

Evgeny Erofeev, Ronny Tredup

Publication date: 22 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-59267-7_20

zbMATH Keywords

synthesisparameterized complexityBoolean Petri net

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

On the parameterized complexity of the synthesis of Boolean nets with restricted place environments

This page was built for publication: On the parameterized complexity of \(d\)-restricted Boolean net synthesis