Login / Signup
On Polynominal Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets (Abstract).
Mitsunori Ogiwara
Osamu Watanabe
Published in:
Computational Complexity Conference (1990)
Keyphrases
</>
truth table
np complete
business process
defeasible logic