no code implementations • 25 Feb 2021 • Dmitry Chistikov, Rupak Majumdar, Philipp Schepper
We show that, in both scenarios, there exist succinct certificates ($O(n^2)$ in the size of the problem) and these certificates can be checked in subcubic (matrix multiplication) time.
Formal Languages and Automata Theory Computational Complexity Programming Languages
