Matrix decomposition problem is complete for the average case
- 4 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 802-811
- https://doi.org/10.1109/fscs.1990.89603
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On the theory of average case complexityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Average case completenessJournal of Computer and System Sciences, 1991
- No better ways to generate hard NP instances than picking uniformly at randomPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- Random instances of a graph coloring problem are hardPublished by Association for Computing Machinery (ACM) ,1988
- Average Case Complete ProblemsSIAM Journal on Computing, 1986
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1984
- Big Omicron and big Omega and big ThetaACM SIGACT News, 1976
- Analysis of the subtractive algorithm for greatest common divisorsProceedings of the National Academy of Sciences, 1975