Luke Friedman
From MaRDI portal
Person:1951573
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Reductions to the set of random strings: the resource-bounded case Logical Methods in Computer Science | 2014-09-05 | Paper |
| Kolmogorov complexity, circuits, and the strength of formal theories of arithmetic Chicago Journal of Theoretical Computer Science | 2014-05-07 | Paper |
| Exponential lower bounds for refuting random formulas using ordered binary decision diagrams Computer Science – Theory and Applications | 2013-06-14 | Paper |
| Limits on the computational power of random strings Information and Computation | 2013-06-06 | Paper |
| Reductions to the set of random strings: the resource-bounded case Lecture Notes in Computer Science | 2012-09-25 | Paper |
| Limits on the Computational Power of Random Strings Automata, Languages and Programming | 2011-07-06 | Paper |
Research outcomes over time
This page was built for person: Luke Friedman
