Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures.
Harry B. Hunt IIIMadhav V. MaratheRichard Edwin StearnsPublished in: ISSAC (2001)
Keyphrases
- algebraic structures
- efficient computation
- partially ordered sets
- optimization algorithm
- computationally efficient
- neural network
- optimization process
- upper bound
- high level
- worst case
- computationally expensive
- decision problems
- global optimization
- query language
- constrained optimization
- space complexity
- inductive inference
- data structure
- optimization model
- complexity analysis
- data sets