An Algorithm to Determine, For any Prime p, A Polynomial-Sized Horn Sentence which Expresses "The Cardinality is not p".
Sauro TulipaniPublished in: J. Symb. Log. (1985)
Keyphrases
- np hard
- preprocessing
- experimental evaluation
- cost function
- improved algorithm
- objective function
- matching algorithm
- dynamic programming
- learning algorithm
- times faster
- worst case
- optimal solution
- computational cost
- segmentation algorithm
- significant improvement
- genetic algorithm
- convergence rate
- computational complexity
- expectation maximization
- input data
- high accuracy
- detection algorithm
- classification algorithm
- linear programming
- search space
- special case
- heuristic rules
- polynomially bounded