Positive Turing and Truth-Table Completeness for NEXP Are Incomparable.

Published in: MFCS (1998)

Keyphrases

truth table
boolean functions
dnf formulas
positive and negative
defeasible logic
data quality
vc dimension
learning algorithm
special case
constraint satisfaction problems
uniform distribution
membership queries
term dnf