Skip to main content
SpringerLink
Log in

A symbolic manipulation system for combinatorial problems

  • Conference paper
  • First Online:
Applicable Algebra, Error-Correcting Codes, Combinatorics and Computer Algebra (AAECC 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 307))

  • 157 Accesses

The present research has been supported by the M. P. I. Project (60%) "Tecniche di manipolazione simbolica".

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bertoni, A., Mauri, G., Torelli, M., Three efficient algorithms for counting problems, Inform. Proc. Lett., 8 (1979), 50–53

    Google Scholar 

  2. Bertoni, A., Mauri, G., Torelli, M., Sulla complessità di alcuni problemi di conteggio, Calcolo, 17 (1980), 163–174

    Google Scholar 

  3. Durand, E., Solutions numérique des équations algébriques, vol. 1, Masson, 1960

    Google Scholar 

  4. Goulden, I.P., Jackson, D.M., Combinatorial Enumeration, Wiley, 1983

    Google Scholar 

  5. Henrici, P., Applied and Computational Complex Analysis, vol.1, Wiley, 1974

    Google Scholar 

  6. Massazza, P., Un sistema di manipolazione simbolica per problemi combinatori: specifiche di strutture e soluzioni di problemi di conteggio, Thesis, Dipartimento di Scienze dell'Informazione, Milano, 1985

    Google Scholar 

  7. Mignotte, M., Some Useful Bounds, in Computer Algebra Symbolic and Algebraic Computation, B. Buchberger et al. Eds., Springer, 1983

    Google Scholar 

  8. Rich, A.D., Stoutemyer, D.R., Capabilities of the muMATH-79 Computer Algebra System for the Intel 8080 Microprocessor, EUROSAM 1979, 241–248

    Google Scholar 

  9. Righi, P., Un sistema di manipolazione simbolica per problemi combinatori: specificazione del problema, Thesis, Dipartimento di Scienze dell'Informazione, Milano, 1985

    Google Scholar 

  10. Stanley, P.R., Generating Functions, in Studies in Combinatorics, (G.C. Rota ed.), MAA Studies in Mathematics, vol.17, The Mathematical Association of America, 1978

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dip. Scienze dell'Informazione, Università di Milano, Italy

    P. Massazza, G. Mauri, P. Righi & M. Torelli

Authors
  1. P. Massazza
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Mauri
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. P. Righi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. M. Torelli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Thomas Beth Michael Clausen

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Massazza, P., Mauri, G., Righi, P., Torelli, M. (1988). A symbolic manipulation system for combinatorial problems. In: Beth, T., Clausen, M. (eds) Applicable Algebra, Error-Correcting Codes, Combinatorics and Computer Algebra. AAECC 1986. Lecture Notes in Computer Science, vol 307. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039182

Download citation

  • DOI: https://doi.org/10.1007/BFb0039182

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19200-8

  • Online ISBN: 978-3-540-39133-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation