On the complexity of the subgraph problem
Jaroslav Nešetřil; Svatopluk Poljak
Commentationes Mathematicae Universitatis Carolinae (1985)
- Volume: 026, Issue: 2, page 415-419
- ISSN: 0010-2628
Access Full Article
top
How to cite
topNešetřil, Jaroslav, and Poljak, Svatopluk. "On the complexity of the subgraph problem." Commentationes Mathematicae Universitatis Carolinae 026.2 (1985): 415-419. <http://eudml.org/doc/17394>.
@article{Nešetřil1985,
author = {Nešetřil, Jaroslav, Poljak, Svatopluk},
journal = {Commentationes Mathematicae Universitatis Carolinae},
keywords = {subgraph containment},
language = {eng},
number = {2},
pages = {415-419},
publisher = {Charles University in Prague, Faculty of Mathematics and Physics},
title = {On the complexity of the subgraph problem},
url = {http://eudml.org/doc/17394},
volume = {026},
year = {1985},
}
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
PB - Charles University in Prague, Faculty of Mathematics and Physics
VL - 026
IS - 2
SP - 415
EP - 419
LA - eng
KW - subgraph containment
UR - http://eudml.org/doc/17394
ER -
References
top- 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) MR0664715
- V. STRASSEN, Gaussian elimination is not optimal, Num. Math. 13 (1969), 354-356. (1969) Zbl0185.40101MR0248973
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.