11151 search results - page 243 / 2231 » On the Complexity of Model Expansion |
159
click to vote
IANDC
2010
15 years 5 months ago
2010
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...
194
click to vote
SIAMSC
2008
15 years 5 months ago
2008
In the mathematical modeling of real-life applications, systems of equations with complex coefficients often arise. While many techniques of numerical linear algebra, e.g., Krylovs...
146
click to vote
IWPC
2010
IEEE
15 years 5 months ago
2010
IEEE
The measure dep-degree is a simple indicator for structural problems and complex dependencies on code-level. We model low-level dependencies between program operations as use-def ...
214
click to vote
COMPUTING
2010
15 years 4 months ago
2010
In this paper, we introduce and analyze a modification of the Hermitian and skewHermitian splitting iteration method for solving a broad class of complex symmetric linear systems....
170
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We prove an optimal (n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal mu...