Automated proofs of upper bounds on the running time of splitting algorithms.
Zapiski Nauchnykh Seminarov POMI (2004)
- Volume: 316, page 111-128
- ISSN: 0373-2703
Access Full Article
topHow to cite
topKulikov, A.S., and Fedin, S.S.. "Automated proofs of upper bounds on the running time of splitting algorithms.." Zapiski Nauchnykh Seminarov POMI 316 (2004): 111-128. <http://eudml.org/doc/222665>.
@article{Kulikov2004,
author = {Kulikov, A.S., Fedin, S.S.},
journal = {Zapiski Nauchnykh Seminarov POMI},
language = {eng},
pages = {111-128},
publisher = {Nauka},
title = {Automated proofs of upper bounds on the running time of splitting algorithms.},
url = {http://eudml.org/doc/222665},
volume = {316},
year = {2004},
}
TY - JOUR
AU - Kulikov, A.S.
AU - Fedin, S.S.
TI - Automated proofs of upper bounds on the running time of splitting algorithms.
JO - Zapiski Nauchnykh Seminarov POMI
PY - 2004
PB - Nauka
VL - 316
SP - 111
EP - 128
LA - eng
UR - http://eudml.org/doc/222665
ER -
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.