Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity over Any Field.
Zeyu GuoNitin SaxenaAmit SinhababuPublished in: Theory Comput. (2019)
Keyphrases
- computational complexity
- worst case
- computational cost
- learning algorithm
- space complexity
- combinatorial optimization
- orders of magnitude
- theoretical analysis
- computationally efficient
- significant improvement
- computational issues
- machine learning
- reduced complexity
- complexity measures
- complexity bounds
- satisfiability problem
- computationally complex
- computational efficiency
- data mining algorithms
- benchmark datasets
- np complete
- optimization problems
- data structure
- computer vision