PP-DEFINABILITY IS CO-NEXPTIME-COMPLETE.

Published in: The Constraint Satisfaction Problem: Complexity and Approximability (2009)

Keyphrases

pspace complete
np complete
artificial neural networks
constraint satisfaction problems
fixed point
satisfiability problem
real world
web services
search algorithm
upper bound
temporal logic
propositional logic