Standaard Boekhandel gebruikt cookies en gelijkaardige technologieën om de website goed te laten werken en je een betere surfervaring te bezorgen.
Hieronder kan je kiezen welke cookies je wilt inschakelen:
Technische en functionele cookies
Deze cookies zijn essentieel om de website goed te laten functioneren, en laten je toe om bijvoorbeeld in te loggen. Je kan deze cookies niet uitschakelen.
Analytische cookies
Deze cookies verzamelen anonieme informatie over het gebruik van onze website. Op die manier kunnen we de website beter afstemmen op de behoeften van de gebruikers.
Marketingcookies
Deze cookies delen je gedrag op onze website met externe partijen, zodat je op externe platformen relevantere advertenties van Standaard Boekhandel te zien krijgt.
Je kan maximaal 250 producten tegelijk aan je winkelmandje toevoegen. Verwijdere enkele producten uit je winkelmandje, of splits je bestelling op in meerdere bestellingen.
Surveys a family of algorithmic techniques for the design of scalable algorithms. These techniques include local network exploration, advanced samplin...Lees meer
Surveys the classical economic theory of Bayesian mechanism design and recent advances from the perspective of algorithms and approximation. Classical...Lees meer
Studies polynomials from a computational perspective. The book illustrates that one can learn a great deal about the structure and complexity of polyn...Lees meer
Illustrates how classical and modern techniques from approximation theory play a crucial role in obtaining results that are relevant to the emerging t...Lees meer
An interactive proof system is called doubly-efficient if the prescribed prover strategy can be implemented in polynomial-time and the verifier's stra...Lees meer
In the last two decades, property testing algorithms have been designed for many types of objects and properties, amongst them, graph properties, alge...Lees meer
Highlights the recent advances in algorithms for numerical linear algebra that have come from the technique of linear sketching, whereby given a matri...Lees meer
Extends the primal-dual method to the setting of online algorithms, and shows its applicability to a wide variety of fundamental problems. Among the o...Lees meer
Introduces locally decodable codes, and discusses the central results of the subject. Locally Decodable Codes assumes basic familiarity with the prope...Lees meer
Incidence theorems describe the way lines, points and other geometric objects intersect each other. Theorems of this sort have found a large number of...Lees meer
Surveys the field of arithmetic circuit complexity, focusing mainly on what the authors find to be the most interesting and accessible research direct...Lees meer
The two primary goals of the text are to learn several canonical problems in communication complexity that are useful for proving lower bounds for alg...Lees meer
Discusses the meaning of differential privacy, and then explores the fundamental techniques for achieving differential privacy, and the application of...Lees meer
Focuses on showing lower bounds on the communication complexity of explicit functions. The book treats different variants of communication complexity,...Lees meer
This self-contained tutorial presents a unified treatment of single- and multi-user problems in Shannon's information theory considering in particular...Lees meer
Surveys several techniques for proving lower bounds in Boolean, algebraic, and communication complexity based on certain linear algebraic approaches. ...Lees meer
Surveys most of the major developments in lattice cryptography over the past ten years. The main focus is on the foundational short integer solution a...Lees meer
Illustrates the emerging paradigm of employing Laplacian solvers to design novel fast algorithms for graph problems through a small but carefully chos...Lees meer
Constraint satisfaction problems are a central pillar of modern computational complexity theory. This monograph provides an introduction to the rapidl...Lees meer
Surveys the key problems, models, and algorithms from online matchings, as well as their implication in the practice of ad allocation. The book provid...Lees meer
Describes modern applications of spectral methods, and novel algorithms for estimating spectral parameters. The first part of the book presents applic...Lees meer
An ideal primer for anyone with an interest in computational complexity, random structures and algorithms and theoretical computer science generally.Lees meer
This primer concentrates on three types of probabilistic proof systems: interactive proofs, zero-knowledge proofs, and probabilistically checkable pro...Lees meer
Provides an overview of many of the known results concerning quantum proofs, computational models based on this concept, and properties of the complex...Lees meer