Abstract
Black box has been an important tool in studying computational complexity theory and has been used for establishing the hardness of problems. With an exponential growth in big data recently, data-driven computation has utilized black box as a tool for proving solutions to some computational problems. In this note, we present several observations on this new role of black box using reduction techniques in the computational complexity theory.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have