Sciweavers

537 search results - page 11 / 108
» A new upper bound for 3-SAT
Sort
View
AAECC
2006
Springer
79views Algorithms» more  AAECC 2006»
14 years 2 months ago
New Bounds on the Capacity of Multi-dimensional RLL-Constrained Systems
Abstract. We examine the well-known problem of determining the capacity of multi-dimensional run-length-limited constrained systems. By recasting the problem, which is essentially ...
Moshe Schwartz, Alexander Vardy
DCG
1999
93views more  DCG 1999»
13 years 8 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
ERSHOV
2003
Springer
14 years 1 months ago
Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean Framework
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.
Henrik Björklund, Sven Sandberg, Sergei G. Vo...
JSC
1998
77views more  JSC 1998»
13 years 8 months ago
Explicit Bounds for the Solutions of Elliptic Equations with Rational Coefficients
Abstract. In this paper we give new, improved explicit upper bounds for the absolute values of the integer solutions and for the heights of S-integer solutions of elliptic equation...
Lajos Hajdu, T. Herendi
TIT
2008
84views more  TIT 2008»
13 years 8 months ago
Bounds for Codes in Products of Spaces, Grassmann, and Stiefel Manifolds
Upper bounds are derived for codes in Stiefel and Grassmann manifolds with given minimum chordal distance. They stem from upper bounds for codes in the product of unit spheres and...
Christine Bachoc, Yael Ben-Haim, Simon Litsyn