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

Complexity Theory

All titles
Complexity Theory

Complexity Theory

Current Research
Klaus Ambos-Spies, Ruprecht-Karls-Universität Heidelberg, Germany
Steven Homer, Boston University
Uwe Schoening, Universität Ulm, Germany
February 1994
Unavailable - out of print April 2000
Hardback
9780521442206
Out of Print
Hardback
    Description

    This volume brings together the recent research of a group of the invited participants in the workshop on Structure and Complexity Theory held in Dagstuhl, Germany in February 1992. The aim of the meeting was to present and discuss new developments in central, active areas of complexity theory and to formulate future goals and research directions. The eleven articles collected in this volume reflect the state of the art in complexity theory and provide a current view of the work of some of its strongest researchers.

    Product details

    February 1994
    Hardback
    9780521442206
    321 pages
    237 × 156 × 20 mm
    0.561kg
    Unavailable - out of print April 2000

    Often bought together

    Higher Recursion Theory
    Higher Recursion Theory

    : Hardback

    Forcing with Random Variables and Proof Complexity
    Forcing with Random Variables and Proof Complexity

    : Paperback

    Algorithmic Randomness
    Algorithmic Randomness

    : Hardback

    Progress and Prospects

    Bounded Arithmetic, Propositional Logic and Complexity Theory
    Bounded Arithmetic, Propositional Logic and Complexity Theory

    : Hardback

    Often bought together

    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.

    The Review of Symbolic Logic
    The Review of Symbolic Logic

    : Journal

    The Review of Symbolic Logic is designed to cultivate research on theborders of logic, philosophy, and the sciences, and to supportsubstantive interactions between these disciplines. The journalwelcomes submissions in any of the following areas, broadly construed: - The general study of logical systems and their semantics,including non-classical logics and algebraic logic; - Philosophical logic and formal epistemology, including interactions with decision theory and game theory; - The history, philosophy, and methodology of logic and mathematics, including the history of philosophy of logic and mathematics; - Applications of logic to the sciences, such as computer science, cognitive science, and linguistics; and logical results addressing foundational issues in the sciences. The Review welcomes submissions in all these areas. (For informationon how to submit papers, see Guidelines below.) The Review beganpublication in June 2008.

    Mathematical Structures in Computer Science
    Mathematical Structures in Computer Science

    : Journal

    Mathematical Structures in Computer Science is a journal of theoretical computer science which focuses on the application of ideas from the structural side of mathematics and mathematical logic to computer science. The journal aims to bridge the gap between theoretical contributions and software design, publishing original papers of a high standard and broad surveys with original perspectives in all areas of computing, provided that ideas or results from logic, algebra, geometry, category theory or other areas of logic and mathematics form a basis for the work. The journal welcomes applications to computing based on the use of specific mathematical structures (e.g. topological and order-theoretic structures) as well as on proof-theoretic notions or results. The journal will also accept contributions in new interdisciplinary fields bridging computer science, quantum physics, mathematics and information theory. In particular, papers on quantum information processing and communication, as well as on the related issues in quantum language design will be considered. The journal is also interested in papers on computational modelling of epigenetics phenomena, protein-protein interaction, stochasticity in molecular cascades. Mathematical approches to System Biology will be welcomed, within the broad frame of post-genomic views of embryogenesis and evolution.

    Related Journals

    Also by this Author

    Contents

    Table of Contents

    • 1. Reductions to sets of low information content V. Arvind, Y. Han, L. Hemachandra, J. Kobler, A. Lozano, M. Mundhenk, M. Ogiwara, U. Schoening, R. Silvestri and T. Thierauf
    • 2. On average P vs. average NP J. Belanger and J. Wang
    • 3. Upper and lower bounds for certain graph accessibility problems on bounded alternating omega-branching programs C. Meinel and S. Waack
    • 4. Bounded reductions H. Buhrman, E. Spaan and L. Torenvliet
    • 5. On the non-uniform complexity of the graph isomorphism problem A. Lozano and J. Toran
    • 6. The complexity of space bounded interactive proof systems A. Condon
    • 7. Degrees of unsolvability in abstract complexity theory M. Kummer
    • 8. Fixed parameter tractability and completeness, R. Downey and M. Fellows
    • 9. Associative storage modification machines J. Tromp and P. van Emde Boas
    • 10. Additional queries and algorithmically random languages R. Book
    • 11. Promise problems and guarded access to unambiguous computation J.-Y. Cai, L. Hemachandra and J. Vyskoc.
      • Show more
    Courses
    Resources
    Additional Information
    About the authors
      Contributors

    • V. Arvind, Y. Han, L. Hemachandra, J. Kobler, A. Lozano, M. Mundhenk, M. Ogiwara, U. Schoening, R. Silvestri, T. Thierauf, J. Belanger, J. Wang, C. Meinel, S. Waack, H. Buhrman, E. Spaan, L. Torenvliet, A. Lozano, J. Toran, A. Condon, M. Kummer, R. Downey, M. Fellows, J. Tromp, P. van Emde Boas, R. Book, J.-Y. Cai, L. Hemachandra, J. Vyskoc

      • Editors
    • Klaus Ambos-Spies , Ruprecht-Karls-Universität Heidelberg, Germany
    • Steven Homer , Boston University
    • Uwe Schoening , Universität Ulm, Germany

    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