On the complexity of the subgraph problem
Nešetřil, Jaroslav ; Poljak, Svatopluk
Commentationes Mathematicae Universitatis Carolinae, Tome 026 (1985), p. 415-419 / Harvested from Czech Digital Mathematics Library
Access to full text
Full (PDF)
Publié le : 1985-01-01
Classification:  05C50,  05C99,  68Q25,  68R10,  90B10 
@article{106381,
     author = {Jaroslav Ne\v set\v ril and Svatopluk Poljak},
     title = {On the complexity of the subgraph problem},
     journal = {Commentationes Mathematicae Universitatis Carolinae},
     volume = {026},
     year = {1985},
     pages = {415-419},
     zbl = {0571.05050},
     mrnumber = {803938},
     language = {en},
     url = {http://dml.mathdoc.fr/item/106381}
}

Nešetřil, Jaroslav; Poljak, Svatopluk. On the complexity of the subgraph problem. Commentationes Mathematicae Universitatis Carolinae, Tome 026 (1985) pp. 415-419. http://gdmltest.u-ga.fr/item/106381/

D. Coppersmith S. Winograd On the asymptotic complexity of matrix multiplication, in: Proceedings 22nd Symposium on Foundations of Comp. Sci, 1981, p. 82-90. (1981) | MR 0664715

V. Strassen Gaussian elimination is not optimal, Num. Math. 13 (1969), 354-356. (1969) | MR 0248973 | Zbl 0185.40101