4066 search results - page 5 / 814 » Almost Complete Sets |
ISCA
2005
IEEE
14 years 1 months ago
2005
IEEE
: The theoretical study of quantum computation has yielded efficient algorithms for some traditionally hard problems. Correspondingly, experimental work on the underlying physical...
WAOA
2005
Springer
14 years 29 days ago
2005
Springer
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. A famous lower bound for the bilinear complexity of the multiplication in associative algebras is the Alder–Strassen bound. Algebras for which this bound is tight are c...
JAT
2006
13 years 7 months ago
2006
We give an explicit parametrization of a set of almost periodic CMV matrices whose spectrum (is equal to the absolute continuous spectrum and) is a homogenous set E lying on the u...
MFCS
1995
Springer
13 years 11 months ago
1995
Springer
Let ≤r and ≤s be two binary relations on 2N which are meant as reducibilities. Let both relations be closed under finite variation (of their set arguments) and consider the un...