Login / Signup

Computational Hardness of the Permuted Kernel and Subcode Equivalence Problems.

Paolo SantiniMarco BaldiFranco Chiaraluce
Published in: IEEE Trans. Inf. Theory (2024)
Keyphrases
  • optimization problems
  • np complete
  • mathematical programming
  • data sets
  • neural network
  • case study
  • support vector
  • computational complexity
  • multi class
  • kernel methods
  • cutting plane
  • np hardness