Related papers: Divisibility Theory and Complexity of Algorithms i…
This is an expository article for the Encyclopedia of Mathematical Physics on the subject in the title.
This is the write-up of the talk I gave at the 23rd International Symposium on Mathematical Programming (ISMP) in Bordeaux, France, July 6th, 2018. The talk was a general overview of the state of the art of time-varying, mainly convex,…
This is a comment published in Phys. Rev. Lett. vol. 73, page 1051 (1994).
Comment on Phys. Rev. A 79, 052312 (2009), http://pra.aps.org/abstract/PRA/v79/i5/e052312
The study of semifeasible algorithms was initiated by Selman's work a quarter of century ago [Sel79,Sel81,Sel82]. Informally put, this research stream studies the power of those sets L for which there is a deterministic (or in some cases,…
This paper considers derivation of $f$-divergence inequalities via the approach of functional domination. Bounds on an $f$-divergence based on one or several other $f$-divergences are introduced, dealing with pairs of probability measures…
In this appendix we provide additional supplementary material to "A Collective, Probabilistic Approach to Schema Mapping." We include an additional extended example, supplementary experiment details, and proof for the complexity result…
This is a corrected version of my paper "Application of integral geometry to minimal surfaces" appeared in International J. Math. vol. 4 Nr. 1 (1993), 89-111. The correction concerns Proposition 3.5. We discuss this correction in Appendix…
This paper contains a list of crucial mistakes and counterexamples to some of the main statements in the paper "Elementary theory of free nonabelian groups" by O. Kharlampovich and A. Myasnikov, which was published in the Journal of Algebra…
This is a list of problems that were collected from participants at the Comparative Prime Number Theory Symposium held at UBC from June 17 to June 21, 2024. Its goal is to stimulate research and future collaborations in this growing field.…
These open problems were presented in the Problem Sessions held during the Tianyuan Workshop on Computability Theory and Descriptive Set Theory, June 16-20, 2025. The problems are organized into sections named after their contributors, in…
This article corrects two mistakes in the article "Coarse homology theories" [math.AT/0106183].
In this version small mistakes are corrected and the exposition is changed as suggested by the referee (to appear in Canadian Journal of Mathematics). The first main result of the paper is a criterion for a partially commutative group $\GG$…
The content of this paper is now available as part of arXiv:0802.2019
We clarify a number of points raised in [Matias, arXiv:cond-mat/0507471v2 (2005)].
Pre-publication version withdrawn at the request of the journal. Final version now available in Reviews of Particle Physics at http://pdg.lbl.gov/2004/reviews/contents_sports.html
This text aims to present and explain quantum machine learning algorithms to a data scientist in an accessible and consistent way. The algorithms and equations presented are not written in rigorous mathematical fashion, instead, the…
Final version to appear in Archiv der Mathematik.
The original derivation of Power Functional Theory, Schmidt and Brader, JCP 138, 214101 (2013), is reworked in some detail with a view to clarifying and simplifying the logic and making explicit the various functional dependencies. We note…
This is a revised version of Sh:430, section 6.