1383 search results - page 164 / 277 » On the Complexity of the Interlace Polynomial |
222
click to vote
TCC
2007
Springer
16 years 16 days ago
2007
Springer
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
189
click to vote
KR
2010
Springer
15 years 11 months ago
2010
Springer
Horn fragments of Description Logics (DLs) have gained popularity because they provide a beneficial trade-off between expressive power and computational complexity and, more spec...
170
click to vote
FOCS
1991
IEEE
15 years 10 months ago
1991
IEEE
We wish to increase the power of an arbitrary algorithm designed for non-degenerate input, by allowing it to execute on all inputs. We concentrate on in nitesimal symbolic perturba...
166
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
204
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...