Geodesic
On the complexity of the subgraph problem
Commentationes Mathematicae Universitatis Carolinae, Tome 26 (1985) no. 2, pp. 415-419 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C50, 05C99, 68Q25, 68R10, 90B10 
@article{CMUC_1985_26_2_a21,
     author = {Ne\v{s}et\v{r}il, Jaroslav and Poljak, Svatopluk},
     title = {On the complexity of the subgraph problem},
     journal = {Commentationes Mathematicae Universitatis Carolinae},
     pages = {415--419},
     year = {1985},
     volume = {26},
     number = {2},
     mrnumber = {803938},
     zbl = {0571.05050},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CMUC_1985_26_2_a21/}
}
TY  - JOUR
AU  - Nešetřil, Jaroslav
AU  - Poljak, Svatopluk
TI  - On the complexity of the subgraph problem
JO  - Commentationes Mathematicae Universitatis Carolinae
PY  - 1985
SP  - 415
EP  - 419
VL  - 26
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/CMUC_1985_26_2_a21/
LA  - en
ID  - CMUC_1985_26_2_a21
ER  - 
%0 Journal Article
%A Nešetřil, Jaroslav
%A Poljak, Svatopluk
%T On the complexity of the subgraph problem
%J Commentationes Mathematicae Universitatis Carolinae
%D 1985
%P 415-419
%V 26
%N 2
%U http://geodesic.mathdoc.fr/item/CMUC_1985_26_2_a21/
%G en
%F CMUC_1985_26_2_a21
Nešetřil, Jaroslav; Poljak, Svatopluk. On the complexity of the subgraph problem. Commentationes Mathematicae Universitatis Carolinae, Tome 26 (1985) no. 2, pp. 415-419. http://geodesic.mathdoc.fr/item/CMUC_1985_26_2_a21/

[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

[2] V. STRASSEN: Gaussian elimination is not optimal. Num. Math. 13 (1969), 354-356. | MR | Zbl