Sciweavers

166 search results - page 19 / 34
» Resultants of partially composed polynomials
Sort
View
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
14 years 7 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
CORR
2008
Springer
137views Education» more  CORR 2008»
13 years 7 months ago
On the Complexity of Nash Equilibria of Action-Graph Games
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
Constantinos Daskalakis, Grant Schoenebeck, Gregor...
CDC
2009
IEEE
125views Control Systems» more  CDC 2009»
14 years 7 days ago
Realization theory of Nash systems
Abstract— This paper deals with realization theory of socalled Nash systems, i.e. nonlinear systems the right-hand side of which is defined by Nash functions. A Nash function is...
Jana Nemcová, Mihály Petreczky, Jan ...
COCO
2010
Springer
148views Algorithms» more  COCO 2010»
13 years 11 months ago
Derandomizing from Random Strings
—In this paper we show that BPP is truth-table reducible to the set of Kolmogorov random strings RK . It was previously known that PSPACE, and hence BPP is Turingreducible to RK ...
Harry Buhrman, Lance Fortnow, Michal Koucký...
DAM
2008
69views more  DAM 2008»
13 years 7 months ago
Impact of memory size on graph exploration capability
A mobile agent (robot), modeled as a finite automaton, has to visit all nodes of a regular graph. How does the memory size of the agent (the number of states of the automaton) inf...
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc