Výsledky vyhledávání - "Algorithms and Computation in Mathematics."
-
1
Book Review S. Basu, R. Pollack, and M.-F. Roy: Algorithms in Real Algebraic Geometry: Algorithms and Computation in Mathematics Series (A.M. Cohen, H. Cohen, D. Eisenbud, M.F. Singer, B. Sturmfels, eds.), vol. 10 (2nd ed.), Springer, 2006, ISBN 978-3-540-33098-1, 662 pages, $79.95
ISSN: 1615-3375, 1615-3383Vydáno: New York Springer-Verlag 01.12.2008Vydáno v Foundations of computational mathematics (01.12.2008)Získat plný text
Book Review -
2
The partial line digraph technique in the design of large interconnection networks
ISSN: 0018-9340Vydáno: New York, NY IEEE 01.07.1992Vydáno v IEEE transactions on computers (01.07.1992)“…The following problem arises in the design of some interconnection networks for distributed systems. Namely, to construct digraphs with given maximum…”
Získat plný text
Journal Article Publikace -
3
COMPLETENESS AND REDUCTION IN ALGEBRAIC COMPLEXITY THEORY (Algorithms and Computation in Mathematics 7)
ISSN: 0024-6093, 1469-2120Vydáno: Oxford University Press 01.01.2002Vydáno v The Bulletin of the London Mathematical Society (01.01.2002)“…By Peter Bürgisser: 168 pp., $44.50, isbn 3‐540‐66752‐0 (Springer, Berlin, 2000)…”
Získat plný text
Book Review -
4
Book Review: Geon Ho Choe, Computational Ergodic Theory. In: M. Bronstein, A. M. Cohen, H. Cohen, D. Eisenbud, and B. Sturmfels (eds.), Algorithms and Computation in Mathematics
ISSN: 0044-2267, 1521-4001Vydáno: Berlin WILEY-VCH Verlag 01.09.2006Vydáno v Zeitschrift für angewandte Mathematik und Mechanik (01.09.2006)Získat plný text
Book Review -
5
COMPLETENESS AND REDUCTION IN ALGEBRAIC COMPLEXITY THEORY (Algorithms and Computation in Mathematics 7) By P ETER B ÜRGISSER : 168 pp., $44.50, ISBN 3-540-66752-0 (Springer, Berlin, 2000)
ISSN: 0024-6093, 1469-2120Vydáno: 01.01.2002Vydáno v The Bulletin of the London Mathematical Society (01.01.2002)Získat plný text
Book Review -
6
COMPLETENESS AND REDUCTION IN ALGEBRAIC COMPLEXITY THEORY (Algorithms and Computation in Mathematics 7) By PETER BÜRGISSER: 168 pp., $44.50, ISBN 3-540-66752-0 (Springer, Berlin, 2000)
ISSN: 0024-6093, 1469-2120Vydáno: Cambridge, UK Cambridge University Press 01.01.2002Vydáno v The Bulletin of the London Mathematical Society (01.01.2002)Získat plný text
Book Review -
7
Characterizing Valiant's algebraic complexity classes
ISSN: 0885-064X, 1090-2708Vydáno: Elsevier Inc 01.02.2008Vydáno v Journal of Complexity (01.02.2008)“…Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families. The basic computation model used is the…”
Získat plný text
Journal Article -
8
Braverman and Yampolsky: Computability of Julia Sets: Algorithms and Computations in Mathematics, Volume 23, Springer
ISSN: 1615-3375, 1615-3383Vydáno: New York Springer-Verlag 01.02.2012Vydáno v Foundations of computational mathematics (01.02.2012)Získat plný text
Book Review Journal Article -
9
Triangulations: structures for algorithms and applications
ISSN: 0009-4978, 1943-5975Vydáno: Middletown American Library Association dba CHOICE 01.09.2011Vydáno v Choice (Middletown) (01.09.2011)“…, Jörg Rambau, and Francisco Santos. Springer, 2010. 535p bibl index afp (Algorithms and computation in mathematics, 25) ISBN 3642129706, $84.95…”
Získat plný text
Book Review -
10
Searching for Loci using GeoGebra
ISSN: 1744-2710, 2045-2519Vydáno: Plymouth Research Information Ltd 01.09.2017Vydáno v International journal for technology in mathematics education (01.09.2017)“…), Some tapas of computer algebra, algorithms and computations in mathematics, vol. 4, Springer, Heidelberg, 276-296…”
Získat plný text
Journal Article