Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
21
click to vote
FOCS
2002
IEEE
84
views
Theoretical Computer Science
»
more
FOCS 2002
»
Power from Random Strings
14 years 5 months ago
Download
www.cs.rutgers.edu
Eric Allender, Harry Buhrman, Michal Koucký...
claim paper
Read More »
45
click to vote
FOCS
2002
IEEE
129
views
Theoretical Computer Science
»
more
FOCS 2002
»
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
14 years 5 months ago
Download
iie.fing.edu.uy
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich
claim paper
Read More »
« first
‹ previous
1
2
3
4
5