CSR 2011 - PDF Preprint Papers

CSR 2011 International Computer Science Symposium

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CSR-2011 Paper

click to vote

CSR
2011
Springer

52views Theoretical Computer Science» more CSR 2011»

Improving the Space-Bounded Version of Muchnik's Conditional Complexity Theorem via "Naive" Derandomization

8 months 28 days ago

Download www.lif.univ-mrs.fr

Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with speciﬁc properties. Usually the probabilistic method gives such objects with b...

Daniil Musatov

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Read	Views	Title	Status
1		52	Improving the Space-Bounded Version of Muchnik's Conditional Complexity Theorem via "Naive" Derandomization	claim
2		38	The Complexity of Inversion of Explicit Goldreich's Function by DPLL Algorithms	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers