相关论文: A course on Combinatorial Algorithms
Combinatorics is a fundamental mathematical discipline as well as an essential component of many mathematical areas, and its study has experienced an impressive growth in recent years. One of the main reasons for this growth is the tight…
In recent years, as fractional calculus becomes more and more broadly used in research across different academic disciplines, there are increasing demands for the numerical tools for the computation of fractional…
This article reports on a study investigating how computational essays can be used to redistribute epistemic agency--cognitive control and responsibility over one's own learning--to students in higher education STEM. Computational essays…
This is the first graduate course on elementary quantum mechanics in Internet written in Romanian for the benefit of Romanian speaking students (Romania and Moldova). It is a translation (with corrections) of the Spanish version of the…
We survey some general-purpose symbolic software packages that implement algorithms from enumerative and analytic combinatorics. Software for the following areas is covered: basic combinatorial objects, symbolic combinatorics, P\'olya…
The online tutoring system CAPA was implemented at Afeka College in the academic year 2000-2001 in calculus based physics courses. It was used also in the academic year 2001-2002 and was very successful in improving understanding and…
- Synth\`ese des travaux pr\'esent\'es en vue d'une Habilitation \`a Diriger des Recherches - Synthesis of works presented towards the Habilitation degree This is a summary (in French) of my work in number theory, group theory and…
Quantum computer programming is emerging as a new subject domain from multidisciplinary research in quantum computing, computer science, mathematics (especially quantum logic, lambda calculi, and linear logic), and engineering attempts to…
This chapter is based on lectures on Randomized Numerical Linear Algebra from the 2016 Park City Mathematics Institute summer school on The Mathematics of Data.
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…
We describe several applications of the theory of cycles to questions in Commutative Algebra. The main topic is the use of the theory of local Chern characters to answer some questions on modules of finite homological dimension. This paper…
These are notes for an advanced course given at Ben Gurion University in Spring 2012.
Combinatorial interpretation of the fibonomial coefficients recently proposed by the present author results here in combinatorial interpretation of the recurrence relation for fibonomial coefficients . The presentation is provided with…
This Ph.D. thesis provides a comprehensive review of the state-of-the-art in the field of Variational Quantum Algorithms and Quantum Machine Learning, including numerous original contributions. The first chapters are devoted to a brief…
The aim of this study is to construct and compose an instructional design in combinatorial learning, particularly in the concept of counting. A composed design is expected to optimize students' combinatorial-thinking skill. This research…
These lecture notes aim to provide a clear and comprehensive introduction to using open quantum system theory for quantum algorithms. The main arguments are Variational Quantum Algorithms, Quantum Error Correction, Dynamical Decoupling and…
These are expanded notes of a course on basics of quantum field theory for mathematicians given by the author at MIT.
Graph colouring is a combinatorial optimisation problem with applications in several important domains, including sports scheduling, cartography, street map navigation, and timetabling. It is also of significant theoretical interest and a…
This paper has been withdrawn by the author; a revised version is part of the author's phd-thesis "Quasi-logarithmic structures" (Zurich, 2007).
Register allocation (mapping variables to processor registers or memory) and instruction scheduling (reordering instructions to increase instruction-level parallelism) are essential tasks for generating efficient assembly code in a…