Login / Signup

Reachability problems in low-dimensional nondeterministic polynomial maps over integers.

Sang-Ki KoReino NiskanenIgor Potapov
Published in: Inf. Comput. (2021)
Keyphrases
  • low dimensional
  • neural network
  • machine learning
  • high dimensional
  • np complete
  • problems involving
  • floating point
  • data sets
  • feature space