How to multiply matrices faster
How to multiply matrices faster
A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM (JACM)
Is the Standard Proof System for SAT P-Optimal?
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
A Logic for PTIME and a Parameterized Halting Problem
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
On slicewise monotone parameterized problems and optimal proof systems for TAUT
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
A parameterized halting problem
The Multivariate Algorithmic Revolution and Beyond
Hard instances of algorithms and proof systems
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
| Hi-index | 5.23 |
A resource-bounded version of the statement ''no algorithm recognizes all non-halting Turing machines'' is equivalent to an infinitely often (i.o.) superpolynomial speedup for the time required to accept any (paddable) coNP-complete language and also equivalent to a superpolynomial speedup in proof length in propositional proof systems for tautologies, each of which implies PNP. This suggests a correspondence between the properties ''has no algorithm at all'' and ''has no best algorithm'' which seems relevant to open problems in computational and proof complexity.