229 search results - page 25 / 46 » Proving Bounds on Real-Valued Functions with Computations |
233
click to vote
WINE
2010
Springer
15 years 3 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...
165
click to vote
FOCS
2004
IEEE
15 years 9 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...
162
click to vote
COMPGEOM
2003
ACM
15 years 11 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...
130
click to vote
JC
2006
15 years 5 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...
161
click to vote
ECCC
2000
15 years 5 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...