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:
Standaard Boekhandel gebruikt cookies en gelijkaardige technologieën om de website goed te laten werken en je een betere surfervaring te bezorgen.
We gebruiken cookies om:
De website vlot te laten werken, de beveiliging te verbeteren en fraude te voorkomen
Inzicht te krijgen in het gebruik van de website, om zo de inhoud en functionaliteiten ervan te verbeteren
Je op externe platformen de meest relevante advertenties te kunnen tonen
Je cookievoorkeuren
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.
Wil je zeker zijn dat je cadeautjes op tijd onder de kerstboom liggen? Onze winkels ontvangen jou met open armen. Nu met extra openingsuren op zondag!
Afhalen na 1 uur in een winkel met voorraad
Gratis thuislevering in België vanaf € 30
Ruim aanbod met 7 miljoen producten
Wil je zeker zijn dat je cadeautjes op tijd onder de kerstboom liggen? Onze winkels ontvangen jou met open armen. Nu met extra openingsuren op zondag!
Je kan maximaal 250 producten tegelijk aan je winkelmandje toevoegen. Verwijdere enkele producten uit je winkelmandje, of splits je bestelling op in meerdere bestellingen.
Algorithmic Results in List Decoding introduces and motivates the problem of list decoding, and discusses the central algorithmic results of the subje...Lees meer
In the last two decades a link has been established that, in some cases, proof that a solution exists has enabled an algorithm to find that solution i...Lees meer
In the age of Big Data, efficient algorithms are in higher demand more than ever before. While Big Data takes us into the asymptotic world envisioned ...Lees meer
Polynomials are perhaps the most important family of functions in mathematics. They feature in celebrated results from both antiquity and modern times...Lees meer
Systems wherein strategic agents compete for limited resources are ubiquitous. For example, the economy, computer networks, social networks, congestio...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
Faster Algorithms via Approximation Theory illustrates how classical and modern techniques from approximation theory play a crucial role in obtaining ...Lees meer
Property testing algorithms are ultra"-efficient algorithms that decide whether a given object (e.g., a graph) has a certain property (e.g., bipartite...Lees meer
Sketching as a Tool for Numerical Linear Algebra highlights the recent advances in algorithms for numerical linear algebra that have come from the tec...Lees meer
Over 60 years of research in coding theory, that started with the works of Shannon and Hamming, have given us nearly optimal ways to add redundancy to...Lees meer
The Design of Competitive Online Algorithms via a Primal-Dual Approach extends the primal-dual method to the setting of online algorithms, and shows i...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
A large class of problems in symbolic computation can be expressed as the task of computing some polynomials; and arithmetic circuits form the most st...Lees meer
Communication Complexity (for Algorithm Designers) collects the lecture notes from the author's eponymous course taught at Stanford in the winter quar...Lees meer
The problem of privacy-preserving data analysis has a long history spanning multiple disciplines. As electronic data about individuals becomes increas...Lees meer
In the thirty years since its inception, communication complexity has become a vital area of theoretical computer science. The applicability of commun...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
While rapid progress has been made on upper bounds (algorithms), progress on lower bounds on the complexity of explicit problems has remained slow des...Lees meer
Lattice-based cryptography is the use of conjectured hard problems on point lattices in Rn as the foundation for secure cryptographic systems. Attract...Lees meer
Coding for interactive communication augments coding theory to the interactive setting: instead of communicating a message from a sender to a receiver...Lees meer
This monograph comprises a series of ten lectures divided into two parts. Part 1, referred to as the Solar Lectures, focuses on the communication and ...Lees meer
NP-completeness arguably forms the most pervasive concept from computer science as it captures the computational complexity of thousands of important ...Lees meer
The ability to solve a system of linear equations lies at the heart of areas like optimization, scientific computing, and computer science and has tra...Lees meer
Constraint satisfaction problems are a central pillar of modern computational complexity theory. This monograph provides an introduction to the rapidl...Lees meer