Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

FOCS
1990
IEEE

favoriteEmaildiscussreport

78views Theoretical Computer Science» more FOCS 1990»

Matrix Decomposition Problem Is Complete for the Average Case

13 years 8 months ago

Matrix Decomposition Problem Is Complete for the Average Case

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

Related Content

» All Natural NPC Problems Have AverageCase Complete Versions

» Collapsing and Separating Completeness Notions under AverageCase and WorstCase Hypotheses

» Factor Analysis of Incidence Data via Novel Decomposition of Matrices

» Deterministic Polynomial Time Algorithms for Matrix Completion Problems

» A Complete and Tight AverageCase Analysis of Learning Monomials

» On the Approximability of Average Completion Time Scheduling under Precedence Constraints

» Spectrally optimal factorization of incomplete matrices

» A complete ensemble empirical mode decomposition with adaptive noise

» Combinatorial Algorithms for Data Migration to Minimize Average Completion Time

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)