Is Polynomial Time Choiceless?

Erich Grädel Martin Grohe

Published in: Fields of Logic and Computation II (2015)

Keyphrases

special case
approximation algorithms
computational complexity
finite automata
worst case
np hardness
information retrieval
artificial intelligence
metadata
data structure
np hard
approximation ratio