1695 search results - page 58 / 339 » Linear, Polynomial or Exponential |
123
click to vote
ISSAC
2005
Springer
15 years 9 months ago
2005
Springer
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
129
click to vote
ICDT
2007
ACM
15 years 10 months ago
2007
ACM
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
183
click to vote
TCC
2007
Springer
15 years 10 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...
125
click to vote
CP
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...
132
click to vote
FCT
2009
Springer
15 years 10 months ago
2009
Springer
In the uniform circuit model of computation, the width of a boolean circuit exactly characterises the “space” complexity of the computed function. Looking for a similar relatio...