1998 search results - page 276 / 400 » Complexity of the Cover Polynomial |
149
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilisti...
157
click to vote
ECCC
2006
15 years 6 months ago
2006
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...
190
click to vote
JSAC
2008
15 years 6 months ago
2008
This paper studies a nonlinear vector precoding scheme which inverts the wireless multiple-input multiple-output (MIMO) channel at the transmitter so that simple symbol-bysymbol de...
177
click to vote
FGCS
2007
15 years 6 months ago
2007
Grid computing is a newly developed technology for complex systems with large-scale resource sharing and multi-institutional collaboration. The prominent feature of grid computing...
183
click to vote
ORL
2008
15 years 6 months ago
2008
We define a generalized variant of the satisfiability problem (SAT) where each "clause" is an or-list of inequalities in n variables. The inequality satisfiability probl...