in Deterministic Polynomial Time.
Karthekeyan ChandrasekaranChandra ChekuriPublished in: Math. Oper. Res. (2022)
Keyphrases
- deterministic domains
- turing machine
- computational complexity
- decomposable negation normal form
- special case
- approximation algorithms
- deterministic automata
- randomized algorithms
- black box
- randomized algorithm
- np hardness
- polynomial hierarchy
- relaxation algorithm
- approximation guarantees
- approximation ratio
- database
- finite automata
- worst case
- expert systems
- information retrieval
- machine learning