Related papers: Lecture notes on complexity of quantifier eliminat…
We describe the design of a quantifier elimination framework for the complex numbers in the language of ordered rings supplemented with symbols for the imaginary unit, real parts, imaginary parts, and conjugates. Technically, we use a…
These are the lecture notes that accompanied the course of the same name that I taught at the Eindhoven University of Technology from 2021 to 2023. The course is intended as an introduction to neural networks for mathematics students at the…
These course notes are about computing modular forms and some of their arithmetic properties. Their aim is to explain and prove the modular symbols algorithm in as elementary and as explicit terms as possible, and to enable the devoted…
All known quantifier elimination procedures for Presburger arithmetic require doubly exponential time for eliminating a single block of existentially quantified variables. It has even been claimed in the literature that this upper bound is…
These notes begin in Chapter 1 with a review of linear algebra and the postulates of quantum mechanics, leading to an explanation of single- and multi-qubit gates. Chapter 2 explores the challenge of constructing arbitrary quantum states…
A didactical survey of the foundations of Algorithmic Information Theory. These notes are short on motivation, history and background but introduce some of the main techniques and concepts of the field. The "manuscript" has been evolving…
These are the lecture notes (in Italian) of a course held in Perugia, Italy, during the summer 2002. They concern the basic facts on the iterative solution of linear systems. The course is self-contained and requires only basic knowledge of…
We prove a PCP theorem for the existential theory of the reals, showing that MAX-ETR-INV is $\exists\mathbb{R}$-hard to approximate to within some constant factor. The existential theory of the reals (ETR) is a decision problem asking if…
These notes are based on a lecture course by L. Chekhov held at the University of Manchester in May 2006 and February-March 2007. They are divulgative in character, and instead of containing rigorous mathematical proofs, they illustrate…
These lecture notes are an informal introduction to the theory of computational complexity and its links to quantum computing and statistical mechanics.
These are notes for the course CS-172 I first taught in the Fall 1986 at UC Berkeley and subsequently at Boston University. The goal was to introduce the undergraduates to basic concepts of Theory of Computation and to provoke their…
These notes grew out of two lectures I have given on CAT(0) cube complexes. I've tried to keep the material elementary and self-contained in order to keep the material easily accessible and to provide an elementary introduction on the topic…
We show that completeness at higher levels of the theory of the reals is a robust notion (under changing the signature and bounding the domain of the quantifiers). This mends recognized gaps in the hierarchy, and leads to stronger…
While concepts and tools from Theoretical Computer Science are regularly applied to, and significantly support, software development for discrete problems, Numerical Engineering largely employs recipes and methods whose correctness and…
These notes are based on lecture courses I gave to third year mathematics students at Cambridge. They could form a basis of an elementary one--term lecture course on integrable systems covering the Arnold-Liouville theorem, inverse…
These are lecture notes that are based on the lectures from a class I taught on the topic of Randomized Linear Algebra (RLA) at UC Berkeley during the Fall 2013 semester.
This is a non-standard paper, containing some problems, mainly in model theory, which I have, in various degrees, been interested in. Sometimes with a discussion on what I have to say; sometimes, of what makes them interesting to me,…
These are lecture notes that arose from a representation theory course given by the first author to the remaining six authors in March 2004 within the framework of the Clay Mathematics Institute Research Academy for high school students,…
This is a self-contained set of lecture notes covering various aspects of the theory of open quantum system, at a level appropriate for a one-semester graduate course. The main emphasis is on completely positive maps and master equations,…
Numerical simulations of quantum field theories on lattices serve as a fundamental tool for studying the non-perturbative regime of the theories, where analytic tools often fall short. Challenges arise when one takes the continuum limit or…