Login / Signup

The membership problem for unmixed polynomial ideals is solvable in single exponential time.

Alicia DickensteinNoaï FitchasMarc GiustiCarmen Sessa
Published in: Discret. Appl. Math. (1991)
Keyphrases
  • np complete
  • special case
  • database
  • computational complexity
  • np hard
  • real time
  • neural network
  • data mining
  • computer vision
  • decision making