Login / Signup

Recognizing DAGs with page-number 2 is NP-complete.

Michael A. BekosGiordano Da LozzoFabrizio FratiMartin GronemannTamara MchedlidzeChrysanthi N. Raftopoulou
Published in: Theor. Comput. Sci. (2023)
Keyphrases
  • np complete
  • small number
  • website
  • computational complexity
  • randomly generated
  • maximum number
  • polynomial time complexity
  • databases
  • neural network
  • decision trees
  • database systems
  • keywords
  • memory requirements