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

Wied Pakusa Svenja Schalthöfer Erkal Selman

Published in: ACM Trans. Comput. Log. (2018)

Keyphrases

databases
information systems
special case
relational databases
np hard
problems involving
np hardness