Automated proofs of upper bounds on the running time of splitting algorithms.
Kulikov, A.S. ; Fedin, S.S.
Zapiski Nauchnykh Seminarov POMI, Tome 314 (2004), p. 111-128 / Harvested from The Electronic Library of Mathematics
Full (PS)
Publié le : 2004-01-01
EUDML-ID : urn:eudml:doc:222665 
@article{02187722,
     title = {Automated proofs of upper bounds on the running time of splitting algorithms.},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     volume = {314},
     year = {2004},
     pages = {111-128},
     zbl = {1136.68629},
     language = {en},
     url = {http://dml.mathdoc.fr/item/02187722}
}

Kulikov, A.S.; Fedin, S.S. Automated proofs of upper bounds on the running time of splitting algorithms.. Zapiski Nauchnykh Seminarov POMI, Tome 314 (2004) pp. 111-128. http://gdmltest.u-ga.fr/item/02187722/