Our systems are now restored following recent technical disruption, and we’re working hard to catch up on publishing. We apologise for the inconvenience caused. Find out more

Item added to bagSorry, there was a problem getting your bag informationItem cannot be purchased with the existing contents of your bagItem unavailable online
✕

was added to your bag.

Please try again.

Sorry, this item cannot be purchased in the same transaction as the existing items in your bag.

Please complete the purchase of the items currently in your bag and then add this item in a separate transaction or visit Shopping Help.

Sorry, this product is not currently available to buy online. Please visit Shopping Help.

View bag and checkout
Remove item
✕

Are you sure you want to remove from your bag?

Recommended product

Popular links

Popular links

Surveys in Combinatorics, 1991

All titles
Surveys in Combinatorics, 1991

Surveys in Combinatorics, 1991

A. D. Keedwell, University of Surrey
March 1992
Paperback
9780521407663
$76.99
USD
Paperback
USD
eBook
    Description

    This volume contains nine invited papers that survey many areas of current research in combinatorics both on the theoretical and practical side. Several papers may be regarded as summarizing our present state of knowledge in a particular topic.

    Product details

    March 1992
    Paperback
    9780521407663
    312 pages
    228 × 152 × 17 mm
    0.48kg
    Available

    Often bought together

    This title is available for institutional purchase via Cambridge Core

    Learn more
    cambridge core banner

    Related Journals

    Combinatorics, Probability and Computing
    Combinatorics, Probability and Computing

    : Journal

    Published bimonthly, Combinatorics, Probability & Computing is devoted to the three areas of combinatorics, probability theory and theoretical computer science. Topics covered include classical and algebraic graph theory, extremal set theory, matroid theory, probabilistic methods and random combinatorial structures; combinatorial probability and limit theorems for random combinatorial structures; the theory of algorithms (including complexity theory), randomised algorithms, probabilistic analysis of algorithms, computational learning theory and optimisation.

    Theory and Practice of Logic Programming
    Theory and Practice of Logic Programming

    : Journal

    Theory and Practice of Logic Programming emphasises both the theory and practice of logic programming. Logic programming applies to all areas of artificial intelligence and computer science and is fundamental to all of them. Among the topics covered are AI applications that use logic programming, logic programming methodologies, specification, analysis and verification of systems, inductive logic programming, multi-relational data mining, natural language processing, knowledge representation, nonmonotonic reasoning, semantic web reasoning, databases, implementations and architectures and constraint logic programming.

    Journal of Functional Programming
    Journal of Functional Programming

    : Journal

    Journal of Functional Programming is the only journal devoted solely to the design, implementation, and application of functional programming languages, spanning the range from mathematical theory to industrial practice. Topics covered include functional languages and extensions, implementation techniques, reasoning and proof, program transformation and synthesis, type systems, type theory, language-based security, memory management, parallelism and applications. Special tracks are devoted to tools and applications, commercial uses and education; pearl-type papers are encouraged. For more details see the Advice for Authors page..Manuscripts for consideration in the Journal of Functional Programming should be submitted electronically, via Scholar One ManuscriptsTM:  http://mc.manuscriptcentral.com/cup/jfp_submit. See Instructions for Contributors.

    Related Journals

    Also by this Author

    Contents

    Table of Contents

    • 1. Radar signal patterns S. W. Golomb
    • 2. Old and new results on ovals of finite projective planes G. Korchmáros
    • 3. Schubert polynomials I. G. MacDonald
    • 4. Computational methods in design theory R. Mathon
    • 5. Unprovable combinatorial statements J. Nesetril [with M. Loebl]
    • 6. Orientations and edge functions on graphs O. Pretzel
    • 7. Graph perturbations P. Rowlinson
    • 8. A graph reconstructer's manual J. A. Bondy
    • 9. Turàn type problems Z. Füredi.
      • Show more
    Courses
    Resources
    Additional Information
    About the authors
      Contributors

    • S. W. Golomb, G. Korchmáros, I. G. MacDonald, R. Mathon, J. Nesetril [with M. Loebl], O. Pretzel, P. Rowlinson, J. A. Bondy, Z. Füredi.

    Browse by related subject

     
    ✕

    Sorry, this item cannot be purchased in the same transaction as the existing items in your cart.

    Please complete the purchase of the items currently in your cart and then add this item in a separate transaction or contact

    Customer Services