The difference between polynomial-time many-one and truth-table reducibilities on distributional problems

DOI10.1007/S00224-002-1025-YzbMath1041.68047OpenAlexW2003644251MaRDI QIDQ1849751

Osamu Watanabe, Rainer Schuler, Tatsuie Tsukiji, Shin Aida

Publication date: 1 December 2002

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-002-1025-y

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: The difference between polynomial-time many-one and truth-table reducibilities on distributional problems