Lower Bounds for Context-Free Grammars Yuval Filmusa,1,∗ a University of Toronto

Source URL: www.cs.toronto.edu

• Applied mathematics
• Context-free grammar
• Regular language
• Constructible universe
• Formal grammar
• Controlled grammar
• Theorems and definitions in linear algebra
• Formal languages
• Mathematics
• Theoretical computer science

Parametric polymorphism through run-time sealing or, Theorems for low, low prices! Jacob Matthews1 and Amal Ahmed2 2 1 University of Chicago

Source URL: www.ccs.neu.edu

• Symbol
• Programming language semantics
• Normalisation by evaluation

Existence and Uniqueness of a Fixed Point for the Bellman Operator in Deterministic Dynamic Programming∗ Takashi Kamihigashi† February 19, 2012

Source URL: www.parisschoolofeconomics.eu

• Operator
• Theorems and definitions in linear algebra
• Mathematics
• Knaster–Tarski theorem
• Order theory

On the Resistance of Prime-variable Rotation Symmetric Boolean Functions against Fast Algebraic Attacks DU Yusong1 * , WEI Baodian2 , ZHANG Fangguo2 & ZHANG Huang2 2 1

Source URL: eprint.iacr.org

• Matrix theory
• Matrices
• Determinants
• Circulant matrix
• Numerical linear algebra
• Matrix
• Eigenvalues and eigenvectors
• Theorems and definitions in linear algebra
• Auxiliary function
• Algebra
• Linear algebra
• Mathematics

COBWEB THEOREMS WITH PRODUCTION LAGS AND PRICE FORECASTING ´ DANIEL DUFRESNE AND FELISA J. VAZQUEZ-ABAD A BSTRACT. The classical cobweb theorem is extended to include production lags and price forecasts. Price forecasti

Source URL: fbe.unimelb.edu.au

• Cobweb model
• Complex number

Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions (full version) Daniel Kraschewski J¨orn M¨

Source URL: eprint.iacr.org

• Communication
• Function
• Inverse function
• Information theory
• Bijection
• Combinatory logic
• Finitary relation
• Mathematics
• Functions and mappings
• Mathematical logic

《敬乐》2005 年第 19 期 EE Dept, CityU of Hong Kong “A mathematician is a machine for turning coffee into theorems.” -- Paul Erdos

Source URL: www.ee.cityu.edu.hk

A Tight Lower Bound for the Steiner Point Removal Problem on Trees T.-H. Hubert Chan1, , Donglin Xia2, , Goran Konjevod2, , and Andrea Richa3, 1

Source URL: i.cs.hku.hk

• Distribution
• Ordinary differential equations
• Spectral theory
• Theorems and definitions in linear algebra
• Orbifold
• Mathematical analysis
• Mathematics
• Tree

Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies Thomas Sauerwald∗ and He Sun∗† Max Planck Institute for Informatics Saarbr¨ucken 66123, Germany † Institute of Modern Mathematics and Ph

Source URL: people.mpi-inf.mpg.de

• Combinatorial optimization
• Matching
• Graph coloring
• Low-discrepancy sequence
• Connectivity
• Theorems and definitions in linear algebra
• Errors-in-variables models
• Mathematics
• Theoretical computer science
• Applied mathematics

29 JuneThree Kinds of Probabilistic Induction: Universal Distributions and Convergence Theorems Ray J. Solomonoff Visiting Professor, Computer Learning Research Centre

Source URL: world.std.com

• Ray Solomonoff
• Applied mathematics
• Statistical inference
• Probability and statistics
• Kolmogorov complexity
• Inductive inference
• Probability
• Expected value
• Artificial intelligence
• Theoretical computer science
• Statistics