Sciweavers

2412 search results - page 19 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
14 years 3 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan
SAIG
2000
Springer
14 years 1 months ago
On Jones-Optimal Specialization for Strongly Typed Languages
The phrase optimal program specialization" was de ned by Jones et al. in 1993 to capture the idea of a specializer being strong enough to remove entire layers of interpretatio...
Henning Makholm
COR
2010
96views more  COR 2010»
13 years 10 months ago
Strong activity rules for iterative combinatorial auctions
Activity rules have emerged in recent years as an important aspect of practical auction design. The role of an activity rule in an iterative auction is to suppress strategic behav...
Pavithra Harsha, Cynthia Barnhart, David C. Parkes...
FUN
2010
Springer
293views Algorithms» more  FUN 2010»
14 years 2 months ago
Computational Complexity of Two-Dimensional Platform Games
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
Michal Forisek
COMPGEOM
2010
ACM
14 years 2 months ago
The complexity of the normal surface solution space
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
Benjamin A. Burton