The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness.
Nadia CreignouPublished in: CSL (1992)
Keyphrases
- similarity measure
- significant improvement
- high accuracy
- quadratic programming
- closed form
- computational cost
- fractional programming
- pairwise
- support vector machine
- dynamic programming
- training samples
- detection method
- combinatorial optimization
- learning algorithm
- multi class problems
- algebraic equations
- genetic algorithm