The complexity of synthesizing elementary net systems relative to natural parameters (Q2304629): Difference between revisions

@@ Property / Wikidata QID @@
+Q126356223
@@ Property / Wikidata QID: Q126356223 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4247285
@@ Property / cites work: Q4247285 / rank @@
+Normal rank
@@ Property / cites work @@
+Petri net synthesis
@@ Property / cites work: Petri net synthesis / rank @@
+Normal rank
@@ Property / cites work @@
+Some complexity results on transition systems and elementary net systems
+Normal rank
@@ Property / cites work @@
+The synthesis problem for elementary net systems is NP-complete
+Normal rank
@@ Property / cites work @@
+Flip-flop nets
@@ Property / cites work: Flip-flop nets / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of synthesis for 43 Boolean Petri net types
+Normal rank
@@ Property / cites work @@
+Elementary net synthesis remains NP-complete even for extremely simple inputs
+Normal rank
@@ Property / cites work @@
+Q5009430
@@ Property / cites work: Q5009430 / rank @@
+Normal rank
@@ Property / cites work @@
+Hard tiling problems with simple tiles
@@ Property / cites work: Hard tiling problems with simple tiles / rank @@
+Normal rank