Search Results - "Algorithms and computation in mathematics"

  • Showing 1 - 10 results of 10
Refine Results
  1. 1
  2. 2

    The partial line digraph technique in the design of large interconnection networks by Fiol, M.A., Llado, A.S.

    ISSN: 0018-9340
    Published: New York, NY IEEE 01.07.1992
    Published in 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…”
    Get full text
    Journal Article Publication
  3. 3

    COMPLETENESS AND REDUCTION IN ALGEBRAIC COMPLEXITY THEORY (Algorithms and Computation in Mathematics 7) by Welsh, D. J. A.

    ISSN: 0024-6093, 1469-2120
    Published: Oxford University Press 01.01.2002
    “…By Peter Bürgisser: 168 pp., $44.50, isbn 3‐540‐66752‐0 (Springer, Berlin, 2000)…”
    Get full text
    Book Review
  4. 4
  5. 5
  6. 6
  7. 7

    Characterizing Valiant's algebraic complexity classes by Malod, Guillaume, Portier, Natacha

    ISSN: 0885-064X, 1090-2708
    Published: Elsevier Inc 01.02.2008
    Published in 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…”
    Get full text
    Journal Article
  8. 8
  9. 9

    Triangulations: structures for algorithms and applications by Feldman, D V

    ISSN: 0009-4978, 1943-5975
    Published: Middletown American Library Association dba CHOICE 01.09.2011
    Published in 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…”
    Get full text
    Book Review
  10. 10

    Searching for Loci using GeoGebra by Blažek, Jiří, Pech, Pavel

    ISSN: 1744-2710, 2045-2519
    Published: Plymouth Research Information Ltd 01.09.2017
    “…), Some tapas of computer algebra, algorithms and computations in mathematics, vol. 4, Springer, Heidelberg, 276-296…”
    Get full text
    Journal Article