Login / Signup

Identification and signatures based on NP-hard problems of indefinite quadratic forms.

Rupert J. HartungClaus-Peter Schnorr
Published in: J. Math. Cryptol. (2008)
Keyphrases
  • np hard problems
  • constraint programming
  • np hard
  • knapsack problem
  • combinatorial search
  • computational complexity
  • objective function
  • linear programming
  • constraint satisfaction problems