HEIGHTS ON PROJECTIVE SPACES AND DYNAMICAL SYSTEMS Height theory is among the fundamental tools frequently used in number theory. A height function measures the arithmetic complexity of a point. It translates thus a geom

Source URL: pub.math.leidenuniv.nl

Riemann’s zeta function and the prime series display a biotic pattern of diversification, novelty, and complexity Louis H. Kauffman and Hector Sabelli University of Illinois at Chicago and Chicago Center for Creative D

Source URL: necsi.edu

Iteration Complexity of Randomized Block-Coordinate Descent Methods for Minimizing a Composite Function Martin Tak´aˇc The University of Edinburgh

Source URL: pdfs.semanticscholar.org

Math. Program., Ser. A DOIs10107z FULL LENGTH PAPER Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function

Source URL: pdfs.semanticscholar.org

Secure Multiparty Computation of Approximations∗ Joan Feigenbaum† Yuval Ishai‡ Martin J. Straussk

Source URL: cs-www.cs.yale.edu

• Cryptography
• Mathematical analysis
• Quantum complexity theory
• Computational complexity theory
• Functions and mappings
• Secure multi-party computation
• Communication complexity
• Secure two-party computation
• Limit of a function
• Cryptographic protocol
• Pi
• PP

Valid Generalisation from Approximate Interpolation Martin Anthony∗ Department of Mathematics The London School of Economics and Political Science Houghton Street, London WC2A 2AE, United Kingdom

Source URL: www.maths.lse.ac.uk

• Machine learning
• Mathematical analysis
• Sample complexity
• Mathematics
• Analysis
• Quasisymmetric map
• Dirac delta function

Algorithmic information, plane Kakeya sets, and conditional dimension Jack H. Lutz∗ Neil Lutz†

Source URL: paul.rutgers.edu

• Mathematics
• Mathematical analysis
• Dimension theory
• Geometry
• Fractals
• Metric geometry
• Effective dimension
• Kakeya set
• Hausdorff dimension
• MinkowskiBouligand dimension
• Kolmogorov complexity
• Limit of a function

Hoti to Construct Random Functions ODED GOLDREICH, SHAFI AND SILVIO MICALI GOLDWASSER,

Source URL: groups.csail.mit.edu

• Cryptography
• Computational complexity theory
• Pseudorandomness
• Analysis of algorithms
• Probabilistic complexity theory
• Pseudorandom function family
• Randomized algorithm
• Random number generation
• Pseudorandom number generator
• One-way function
• Advantage
• IP

Space-Efficient Randomized Algorithms for K-SUM Joshua R. Wang Stanford University, Stanford CA 94305, USA

Source URL: web.stanford.edu

• Mathematics
• Search algorithms
• Information retrieval
• Information science
• Hashing
• Analysis of algorithms
• Cryptographic hash functions
• Computational complexity theory
• Universal hashing
• Hash function
• Randomized algorithm
• Subset sum problem

PDF Document

Source URL: www.math.csi.cuny.edu

• Mathematical analysis
• Mathematics
• Statistics
• Circuit complexity
• NC
• Normal distribution
• Polynomials
• Bessel function
• Table of stars with Bayer designations