229 search results - page 25 / 46 » Proving Bounds on Real-Valued Functions with Computations |
130
click to vote
WINE
2010
Springer
14 years 8 months ago
2010
Springer
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
FOCS
2004
IEEE
15 years 1 months ago
2004
IEEE
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...
COMPGEOM
2003
ACM
15 years 3 months ago
2003
ACM
Given a Morse function over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight u...
JC
2006
14 years 10 months ago
2006
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
ECCC
2000
14 years 10 months ago
2000
Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated input tape are considered. We investigate the classes of languages acceptable by s...