- other
Advances in convex optimization: conic programming - Arkadi ...
(i) (Polynomial computability) There exists an algorithm O which, given on in- ... [74] Ye, Y., Interior-Point Algorithms: Theory and Analysis. Wiley ...
- journal article file
Amenability and acyclicity in bounded cohomology
Jan 21, 2023 ... The central role of amenability in the theory of bounded cohomology is further elu- cidated by Gromov's mapping theorem [16, 17, 21]. We state ...
- journal article file
Universal Borel actions of countable groups
Rogers, Jr., Theory of recursive functions and effective computability. 2nd ed., MIT. Press, Cambridge, MA, 1987. MR 886890. [26] D. Sonkin, CEP-subgroups of ...
- journal article file
Coherent randomness tests and computing the K-trivial sets
between computability and randomness. One example is related to an ... [6] Chaitin, G.: A theory of program size formally identical to information theory.
- journal article file
Words in linear groups, random walks, automata and P-recursiveness
computability. Roughly, we give an explicit construction of a finite ... analysis, analytic number theory, probability and group theory. Denote by ...
- journal article file
Abel interview 2021: László Lovász and Avi Wigderson
notions of efficient computability were equivalent. ... So I had to learn, and I still have to learn much more mathematics, especially in- variant theory, ...
- journal article file
Topological Cyclic Homology Via the Norm
Jun 27, 2018 ... tion of the relative theory in terms of absolute theory. More often ... “naive” tensor power approach and the strength (and relative computability).
- journal article file
Mathematisches Forschungsinstitut Oberwolfach Mathematical ...
Proof mining. • Constructive and semi-constructive reasoning. • Proof theory and theoretical computer science. • Structural proof theory. Mathematics ...
- journal article file
Mini-Workshop: Homological aspects of TDLC-groups
point of interest for geometric group theory and the theory of TDLC groups. ... Arguably the question for FP2 and FP3 should be easier because computability seems ...
- journal article file
Asymptotically nonexpansive mappings in uniformly convex ...
May 23, 2007 ... ... computability when dealing with argu- ments in NN. Page 13 ... Theory and Applications (Valencia, 2003), Yokohama Publ., Yokohama ...