Club utilise des cookies et des technologies similaires pour faire fonctionner correctement le site web et vous fournir une meilleure expérience de navigation.
Ci-dessous vous pouvez choisir quels cookies vous souhaitez modifier :
Club utilise des cookies et des technologies similaires pour faire fonctionner correctement le site web et vous fournir une meilleure expérience de navigation.
Nous utilisons des cookies dans le but suivant :
Assurer le bon fonctionnement du site web, améliorer la sécurité et prévenir la fraude
Avoir un aperçu de l'utilisation du site web, afin d'améliorer son contenu et ses fonctionnalités
Pouvoir vous montrer les publicités les plus pertinentes sur des plateformes externes
Club utilise des cookies et des technologies similaires pour faire fonctionner correctement le site web et vous fournir une meilleure expérience de navigation.
Ci-dessous vous pouvez choisir quels cookies vous souhaitez modifier :
Cookies techniques et fonctionnels
Ces cookies sont indispensables au bon fonctionnement du site internet et vous permettent par exemple de vous connecter. Vous ne pouvez pas désactiver ces cookies.
Cookies analytiques
Ces cookies collectent des informations anonymes sur l'utilisation de notre site web. De cette façon, nous pouvons mieux adapter le site web aux besoins des utilisateurs.
Cookies marketing
Ces cookies partagent votre comportement sur notre site web avec des parties externes, afin que vous puissiez voir des publicités plus pertinentes de Club sur des plateformes externes.
Une erreur est survenue, veuillez réessayer plus tard.
Il y a trop d’articles dans votre panier
Vous pouvez encoder maximum 250 articles dans votre panier en une fois. Supprimez certains articles de votre panier ou divisez votre commande en plusieurs commandes.
Surveys a family of algorithmic techniques for the design of scalable algorithms. These techniques include local network exploration, advanced samplin...Savoir plus
Surveys the classical economic theory of Bayesian mechanism design and recent advances from the perspective of algorithms and approximation. Classical...Savoir plus
Studies polynomials from a computational perspective. The book illustrates that one can learn a great deal about the structure and complexity of polyn...Savoir plus
An interactive proof system is called doubly-efficient if the prescribed prover strategy can be implemented in polynomial-time and the verifier's stra...Savoir plus
Illustrates how classical and modern techniques from approximation theory play a crucial role in obtaining results that are relevant to the emerging t...Savoir plus
In the last two decades, property testing algorithms have been designed for many types of objects and properties, amongst them, graph properties, alge...Savoir plus
Highlights the recent advances in algorithms for numerical linear algebra that have come from the technique of linear sketching, whereby given a matri...Savoir plus
Introduces locally decodable codes, and discusses the central results of the subject. Locally Decodable Codes assumes basic familiarity with the prope...Savoir plus
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...Savoir plus
Surveys the field of arithmetic circuit complexity, focusing mainly on what the authors find to be the most interesting and accessible research direct...Savoir plus
Incidence theorems describe the way lines, points and other geometric objects intersect each other. Theorems of this sort have found a large number of...Savoir plus
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...Savoir plus
Discusses the meaning of differential privacy, and then explores the fundamental techniques for achieving differential privacy, and the application of...Savoir plus
Focuses on showing lower bounds on the communication complexity of explicit functions. The book treats different variants of communication complexity,...Savoir plus
This self-contained tutorial presents a unified treatment of single- and multi-user problems in Shannon's information theory considering in particular...Savoir plus
Surveys several techniques for proving lower bounds in Boolean, algebraic, and communication complexity based on certain linear algebraic approaches. ...Savoir plus
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...Savoir plus
Surveys the key problems, models, and algorithms from online matchings, as well as their implication in the practice of ad allocation. The book provid...Savoir plus
Constraint satisfaction problems are a central pillar of modern computational complexity theory. This monograph provides an introduction to the rapidl...Savoir plus
Illustrates the emerging paradigm of employing Laplacian solvers to design novel fast algorithms for graph problems through a small but carefully chos...Savoir plus
Describes modern applications of spectral methods, and novel algorithms for estimating spectral parameters. The first part of the book presents applic...Savoir plus
An ideal primer for anyone with an interest in computational complexity, random structures and algorithms and theoretical computer science generally.Savoir plus
This primer concentrates on three types of probabilistic proof systems: interactive proofs, zero-knowledge proofs, and probabilistically checkable pro...Savoir plus
Provides an overview of many of the known results concerning quantum proofs, computational models based on this concept, and properties of the complex...Savoir plus