Login / Signup
Overloading Is NP-Complete - A Tutorial Dedicated to Dexter Kozen.
Jens Palsberg
Published in:
Logic and Program Semantics (2012)
Keyphrases
</>
np complete
np hard
randomly generated
satisfiability problem
computational complexity
constraint satisfaction problems
conjunctive queries
pspace complete
np complete problems
data complexity
polynomial time complexity
databases
scheduling problem
expressive power
topics covered
tutorial dialogue