On Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets.

Mitsunori Ogiwara Osamu Watanabe

Published in: SIAM J. Comput. (1991)

Keyphrases

truth table
boolean functions
computational complexity
defeasible logic
rough sets
special case
np hard
linear programming
logic programs
dnf formulas