Das, Bireswar; Scharpfenecker, Patrick; Toran, Jacobo
(Elsevier, 2017-04)
It is well-known that succinct encodings of computational problems – using circuits or formulas to encode large instances – generally result in an exponential complexity blow-up compared to their original complexity.
We ...