179 search results - page 24 / 36 » The proof of Hermann's conjecture |
JC
2008
13 years 7 months ago
2008
Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families. The basic computation model used is the arithmetic circuit, which ma...
EJC
2007
13 years 7 months ago
2007
We present various techniques to count proportions of permutations with restricted cycle structure in finite permutation groups. For example, we show how a generalized block theo...
JCT
2007
13 years 7 months ago
2007
We enumerate lattice paths in the planar integer lattice consisting of positively directed unit vertical and horizontal steps with respect to a specific elliptic weight function. ...
DCG
1999
13 years 7 months ago
1999
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 ...
CCS
2008
ACM
13 years 9 months ago
2008
ACM
A practically feasible modification to fixed-priority schedulers allows to avoid timing channels despite threads having access to precise clocks. This modification is rather simpl...