Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time.

Wied Pakusa Svenja Schalthöfer Erkal Selman

Published in: CSL (2016)

Keyphrases

computational complexity
optimization problems
data sets
np complete
benchmark problems
real time
databases
artificial intelligence
knowledge base
decision trees
multi objective
scheduling problem
fixed point
propositional logic
solving problems