Login / Signup

A Graph-Transformational Approach for Proving the Correctness of Reductions between NP-Problems.

Hans-Jörg KreowskiSabine KuskeAaron LyeAljoscha Windhorst
Published in: CoRR (2022)
Keyphrases
  • np complete
  • graph structure
  • neural network
  • random walk
  • application domains
  • machine learning
  • computational complexity
  • probabilistic model
  • linear programming
  • benchmark problems
  • problems involving