73 search results - page 11 / 15 » On the Complexity of Solving a Bivariate Polynomial System |
TAPSOFT
1991
Springer
13 years 11 months ago
1991
Springer
Type inference can be phrased as constraint-solving over types. We consider an implicitly typed language equipped with recursive types, multiple inheritance, 1st order parametric ...
TCC
2007
Springer
14 years 1 months 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...
RECOMB
2002
Springer
14 years 7 months ago
2002
Springer
We present an original approach to identifying sequence variants in a mixed DNA population from sequence trace data. The heart of the method is based on parsimony: given a wildtyp...
MOBIHOC
2008
ACM
14 years 7 months ago
2008
ACM
Recently, cooperative communications, in the form of keeping each node with a single antenna and having a node exploit a relay node's antenna, is shown to be a promising appr...
EUROCRYPT
2003
Springer
14 years 23 days ago
2003
Springer
A classical construction of stream ciphers is to combine several LFSRs and a highly non-linear Boolean function f. Their security is usually analysed in terms of correlation attack...