Skip to main content Accessibility help
×
  1. Home
  2. Browse subjects
  3. Computer Science
  4. Algorithmics, Complexity, Computer Algebra, Computational Geometry
  5. Content listing

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

6917 results in Algorithmics, Complexity, Computer Algebra, Computational Geometry

Page 1 of 346

Basic Graph Theory
  • Béla Bollobás, Robert Morris
  • Coming soon
  • Expected online publication date:
    April 2026
    Print publication:
    30 April 2026
  • Over the past few decades, graph theory has developed into one of the central areas of modern mathematics, with close (and growing) connections to areas of pure mathematics such as number theory, probability theory, algebra and geometry, as well as to applied areas such as the theory of networks, machine learning, statistical physics, and biology. It is a young and vibrant area, with several major breakthroughs having occurred in just the past few years. This book offers the reader a gentle introduction to the fundamental concepts and techniques of graph theory, covering classical topics such as matchings, colourings and connectivity, alongside the modern and vibrant areas of extremal graph theory, Ramsey theory, and random graphs. The focus throughout is on beautiful questions, ideas and proofs, and on illustrating simple but powerful techniques, such as the probabilistic method, that should be part of every young mathematician's toolkit.

Games, Markets, and Online Learning
  • Christian Kroer
  • Coming soon
  • Expected online publication date:
    March 2026
    Print publication:
    01 April 2027
  • This book presents a modern introduction to the field of algorithmic game theory. It places a heavy emphasis on optimization and online learning (a subdiscipline of machine learning), which are tools that increasingly play a central role in both the theory and practice of applying game-theoretic ideas. The book covers the core techniques used in several majorly successful applications, including techniques used for creating superhuman poker AIs, the theory behind the 'pacing' methodology that has become standard in the internet advertising industry, and the application of competitive equilibrium from equal incomes for fair course seat allocation in many business schools. With its focus on online learning tools, this book is an ideal companion to classic texts on algorithmic game theory for graduate students and researchers.

Extremal Graph and Hypergraph Theory

Quantum Computing Unveiled
  • A Concise Course with Topological Extensions
  • Yidun Wan
  • Coming soon
  • Expected online publication date:
    January 2026
    Print publication:
    31 January 2026
  • Aimed at advanced undergraduate and graduate-level students, this textbook covers the core topics of quantum computing in a format designed for a single-semester course. It will be accessible to learners from a range of disciplines, with an understanding of linear algebra being the primary prerequisite. The textbook introduces central concepts such as quantum mechanics, the quantum circuit model, and quantum algorithms, and covers advanced subjects such as the surface code and topological quantum computation. These topics are essential for understanding the role of symmetries in error correction and the stability of quantum architectures, which situate quantum computation within the wider realm of theoretical physics. Graphical representations and exercises are included throughout the book and optional expanded materials are summarized within boxed 'Remarks'. Lecture notes have been made freely available for download from the textbook's webpage, with instructors having additional online access to selected exercise solutions.

The Mathematics of Origami
  • Joseph O'Rourke
  • Coming soon
  • Expected online publication date:
    December 2025
    Print publication:
    31 December 2025
  • When you see a paper crane, what do you think of? A symbol of hope, a delicate craft, The Karate Kid? What you might not see, but is ever present, is the fascinating mathematics underlying it. Origami is increasingly applied to engineering problems, including origami-based stents, deployment of solar arrays in space, architecture, and even furniture design. The topic is actively developing, with recent discoveries at the frontier (e.g., in rigid origami and in curved-crease origami) and an infusion of techniques and algorithms from theoretical computer science. The mathematics is often advanced, but this book instead relies on geometric intuition, making it accessible to readers with only a high school geometry and trigonometry background. Through careful exposition, more than 150 color figures, and 49 exercises all completely solved in an Appendix, the beautiful mathematics leading to stunning origami designs can be appreciated by students, teachers, engineers, and artists alike.

Quantum Computing for Programmers
  • 2nd edition
  • Robert Hundt
  • Coming soon
  • Expected online publication date:
    November 2025
    Print publication:
    30 November 2025
  • This introduction to quantum computing from a classical programmer's perspective is meant for students and practitioners alike. More than 50 quantum techniques and algorithms are explained with mathematical derivations and code for simulation, using an open-source code base in Python and C++. New material throughout this fully revised and expanded second edition includes new chapters on Quantum Machine Learning, State Preparation, and Similarity Tests. Coverage includes algorithms exploiting entanglement, black-box algorithms, the quantum Fourier transform, phase estimation, quantum walks, and foundational QML algorithms. Readers will find detailed, easy-to-follow derivations and implementations of Shor's algorithm, Grover's algorithm, SAT3, graph coloring, the Solovay-Kitaev algorithm, Moettoenen's algorithm, quantum mean, median, and minimum finding, Deutsch's algorithm, Bernstein-Vazirani, quantum teleportation and superdense coding, the CHSH game, and, from QML, the HHL algorithm, Euclidean distance, and PCA. The book also discusses productivity issues like quantum noise, error correction, quantum programming languages, compilers, and techniques for transpilation.

Page 1 of 346