output
20022005
most citedThe Dynamics of 1D Quantum Spin Systems Can Be Approximated Efficiently

167 citations

11 papers

cs.DM20053 cited

Minimum Cost Homomorphisms to Semicomplete Multipartite Digraphs

G. Gutin, A. Rafiey, A. Yeo

For digraphs and , a mapping $f: V(D)\dom V(H)$ is a {\em homomorphism of to } if implies For a fixed directed or undirected graph $H…

cs.DM2005

Minimum Cost and List Homomorphisms to Semicomplete Digraphs

G. Gutin, A. Rafiey, A. Yeo

The following optimization problem was introduced in \cite{gutinDAM}, where it was motivated by a real-world problem in defence logistics. Suppose we are given a pair of digraphs $…

quant-ph2005167 cited

The Dynamics of 1D Quantum Spin Systems Can Be Approximated Efficiently

Tobias J. Osborne

In this Letter we show that an arbitrarily good approximation to the propagator e^{itH} for a 1D lattice of n quantum spins with hamiltonian H may be obtained with polynomial compu…

cs.LG200518 cited

Competitive on-line learning with a convex loss function

Vladimir Vovk

We consider the problem of sequential decision making under uncertainty in which the loss caused by a decision depends on the following binary observation. In competitive on-line l…

cs.LG20051 cited

Defensive forecasting for linear protocols

Vladimir Vovk, Ilia Nouretdinov, Akimichi Takemura +1

We consider a general class of forecasting protocols, called "linear protocols", and discuss several important special cases, including multi-class forecasting. Forecasting is form…

math.NT2005

Salem numbers, Pisot numbers, Mahler measure and graphs

James McKee, Chris Smyth

We use graphs to define sets of Salem and Pisot numbers, and prove that the union of these sets is closed, supporting a conjecture of Boyd that the set of all Salem and Pisot numbe…