About DML-CZ | FAQ | Conditions of Use | Math Archives | Contact Us
  Previous |  Up |  Next

Article

First Page Preview
Nešetřil, Jaroslav ; Poljak, Svatopluk
On the complexity of the subgraph problem. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 26 (1985), issue 2, pp. 415-419
MSC: 05C50, 05C99, 68Q25, 68R10, 90B10 | MR 803938 | Zbl 0571.05050
References:
[1] D. COPPERSMITH S. WINOGRAD: On the asymptotic complexity of matrix multiplication. in: Proceedings 22nd Symposium on Foundations of Comp. Sci, 1981, p. 82-90. MR 0664715
[2] V. STRASSEN: Gaussian elimination is not optimal. Num. Math. 13 (1969), 354-356. MR 0248973 | Zbl 0185.40101
Partner of
EuDML logo