Extending C++ Static Computation of Polynomial-Time Algorithms.
Emanuele CovinoGiovanni PaniDaniele ScrimieriPublished in: FCS (2008)
Keyphrases
- computational complexity
- orders of magnitude
- learning algorithm
- recently developed
- computational cost
- theoretical analysis
- computationally efficient
- neural network
- times faster
- optimization problems
- special case
- significant improvement
- simulated annealing
- data mining techniques
- worst case
- upper bound
- benchmark datasets
- computationally expensive
- data sets