Sciweavers

1132 search results - page 32 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
DCG
1999
93views more  DCG 1999»
13 years 7 months ago
New Maximal Numbers of Equilibria in Bimatrix Games
This paper presents a new lower bound of 2:414d= p d on the maximal number of Nash equilibria in d d bimatrix games, a central concept in game theory. The proof uses an equivalent ...
Bernhard von Stengel
MFCS
2004
Springer
14 years 23 days ago
Online Algorithms for Disk Graphs
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
Ioannis Caragiannis, Aleksei V. Fishkin, Christos ...
CORR
2008
Springer
91views Education» more  CORR 2008»
13 years 7 months ago
The Mixing Time of Glauber Dynamics for Colouring Regular Trees
We consider Metropolis Glauber dynamics for sampling proper qcolourings of the n-vertex complete b-ary tree when 3 q b/2 ln(b). We give both upper and lower bounds on the mixing...
Leslie Ann Goldberg, Mark Jerrum, Marek Karpinski
TPHOL
2005
IEEE
14 years 29 days ago
Real Number Calculations and Theorem Proving
Wouldn’t it be nice to be able to conveniently use ordinary real number expressions within proof assistants? In this paper we outline how this can be done within a theorem provin...
César Muñoz, David Lester
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
14 years 2 months ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti