Related papers: An exponential lower bound for Cunningham's rule

This paper considers repeated games in which one player has more information about the game than the other players. In particular, we investigate repeated two-player zero-sum games where only the column player knows the payoff matrix A of…

We consider the problem of computing the maximal probability of satisfying an omega-regular specification for stochastic nonlinear systems evolving in discrete time. The problem reduces, after automata-theoretic constructions, to finding…

Previously, Bennet and Feynman asked if Heisenberg's uncertainty principle puts a limitation on a quantum computer (Quantum Mechanical Computers, Richard P. Feynman, Foundations of Physics, Vol. 16, No. 6, p597-531, 1986). Feynman's answer…

We provide a series of algorithms demonstrating that solutions according to the fundamental game-theoretic solution concept of closed under rational behavior (CURB) sets in two-player, normal-form games can be computed in polynomial time…

The well known phenomenon of exponential contraction for solutions to the viscous Hamilton-Jacobi equation in the space-periodic setting is based on the Markov mechanism. However, the corresponding Lyapunov exponent $\lambda(\nu)$…

In this thesis we develop a novel framework to study smooth and strongly convex optimization algorithms, both deterministic and stochastic. Focusing on quadratic functions we are able to examine optimization algorithms as a recursive…

We develop an algorithmic framework for solving convex optimization problems using no-regret game dynamics. By converting the problem of minimizing a convex function into an auxiliary problem of solving a min-max game in a sequential…

Given two orthornormal bases A and B, the basic form of the entropic uncertainty principle is stated in terms of the sum of the Shannon entropies of the probabilities of measuring A and B onto a given quantum state. State independent lower…

We provide two new methods for computing lower bounds of eigenvalues of symmetric elliptic second-order differential operators with mixed boundary conditions of Dirichlet, Neumann, and Robin type. The methods generalize ideas of Weinstein's…

Let ${\mathcal D}(n)$ be the maximal determinant for $n \times n$ $\{\pm 1\}$-matrices, and $\mathcal R(n) = {\mathcal D}(n)/n^{n/2}$ be the ratio of ${\mathcal D}(n)$ to the Hadamard upper bound. Using the probabilistic method, we prove…

We show that Durr-Hoyer's quantum algorithm of searching for extreme point of integer function can not be sped up for functions chosen randomly. Any other algorithm acting in substantially shorter time $o(\sqrt{2^n})$ gives incorrect answer…

In this paper we develop algorithms for approximating matrix multiplication with respect to the spectral norm. Let A\in{\RR^{n\times m}} and B\in\RR^{n \times p} be two matrices and \eps>0. We approximate the product A^\top B using two…

The existential k-pebble game characterizes the expressive power of the existential-positive k-variable fragment of first-order logic on finite structures. The winner of the existential k-pebble game on two given finite structures can be…

We present lower bounds for the orbit length of reduction modulo primes of parametric polynomial dynamical systems defined over the integers, under a suitable hypothesis on its set of preperiodic points over $\mathbb C$. Applying recent…

We investigate sublinear classical and quantum algorithms for matrix games, a fundamental problem in optimization and machine learning, with provable guarantees. Given a matrix $A\in\mathbb{R}^{n\times d}$, sublinear algorithms for the…

Calude, Jain, Khoussainov, Li, and Stephan (2017) proposed a quasi-polynomial-time algorithm solving parity games. After this breakthrough result, a few other quasi-polynomial-time algorithms were introduced; none of them is easy to…

The algebraic intersection type unification problem is an important component in proof search related to several natural decision problems in intersection type systems. It is unknown and remains open whether the algebraic intersection type…

Many combinatorial optimization problems admit a maximin fairness variant, where the aim is to find a distribution over possible solutions which maximizes an expected worst-case outcome. However, the support for an optimal distribution may…

This paper considers a probabilistic model for floating-point computation in which the roundoff errors are represented by bounded random variables with mean zero. Using this model, a probabilistic bound is derived for the forward error of…

This paper develops an algorithm for upper- and lower-bounding the value function for a class of linear time-varying games subject to convex control sets. In particular, a two-player zero-sum differential game is considered where the…