Sciweavers

2200 search results - page 156 / 440
» Bloch's Constant is Computable
Sort
View
ECCC
2006
71views more  ECCC 2006»
15 years 6 months ago
Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...
Spyros C. Kontogiannis, Panagiota N. Panagopoulou,...
CC
2005
Springer
118views System Software» more  CC 2005»
15 years 6 months ago
The complexity of constructing pseudorandom generators from hard functions
We study the complexity of constructing pseudorandom generators (PRGs) from hard functions, focussing on constant-depth circuits. We show that, starting from a function f : {0, 1}l...
Emanuele Viola
JSC
2007
119views more  JSC 2007»
15 years 6 months ago
Equisingular calculations for plane curve singularities
We present an algorithm which, given a deformation with section of a reduced plane curve singularity, computes equations for the equisingularity stratum (that is, the µ-constant s...
Antonio Campillo, Gert-Martin Greuel, Christoph Lo...
WG
2010
Springer
15 years 4 months ago
On the Small Cycle Transversal of Planar Graphs
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...
Ge Xia, Yong Zhang
CORR
2011
Springer
206views Education» more  CORR 2011»
14 years 10 months ago
A Study of Language Usage Evolution in Open Source Software
: In December of 2010, the new game CityVille achieved 6 million daily active users in just 8 days. Clearly the success of CityVille owes something to the fun gameplay experience i...
Siim Karus, Harald Gall