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
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
32
click to vote
FOCS
1990
IEEE
favorite
Email
discuss
report
78
views
Theoretical Computer Science
»
more
FOCS 1990
»
Matrix Decomposition Problem Is Complete for the Average Case
14 years 4 months ago
Download
research.microsoft.com
The first algebraic average-case complete problem is presented. It is arguably the simplest natural average-case complete problem to date.
Yuri Gurevich
Real-time Traffic
Average-case Complete Problem
|
FOCS 1990
|
Theoretical Computer Science
|
claim paper
Post Info
More Details (n/a)
Added
11 Aug 2010
Updated
11 Aug 2010
Type
Conference
Year
1990
Where
FOCS
Authors
Yuri Gurevich
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision