Login / Signup

Elementary Net Synthesis Remains NP-Complete Even for Extremely Simple Inputs.

Ronny TredupChristian RosenkeKarsten Wolf
Published in: Petri Nets (2018)
Keyphrases
  • np complete
  • information retrieval
  • randomly generated
  • database
  • real time
  • genetic algorithm
  • clustering algorithm
  • upper bound
  • conjunctive queries
  • phase transition
  • desirable properties
  • program synthesis