Login / Signup
On the difference between polynomial-time many-one and truth-table reducibilities on distributional problems
Shin Aida
Rainer Schuler
Tatsuie Tsukiji
Osamu Watanabe
Published in:
Electron. Colloquium Comput. Complex. (2000)
Keyphrases
</>
truth table
optimization problems
np complete
computational complexity
worst case