An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting.

Daniel de Carvalho Jakob Grue Simonsen

Published in: RTA-TLCA (2014)

Keyphrases

datalog programs
computational complexity
polynomial hierarchy
special case
neural network
worst case
transitive closure
rewrite rules
conjunctive queries
approximation algorithms
rewriting rules