Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The complexity of Boolean state separation

From MaRDI portal
Publication:2037940
Jump to:navigation, search

DOI10.1007/978-3-030-64276-1_7OpenAlexW3108297846MaRDI QIDQ2037940

Ronny Tredup, Evgeny Erofeev

Publication date: 8 July 2021

Full work available at URL: https://arxiv.org/abs/2010.00825


zbMATH Keywords

Boolean Petri netsBoolean state separationcomplexity characterization


Mathematics Subject Classification ID

Theory of computing (68Qxx)


Related Items (2)

On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets ⋮ Unnamed Item




This page was built for publication: The complexity of Boolean state separation

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2037940&oldid=14508703"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 19:11.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki