1998 search results - page 96 / 400 » Complexity of the Cover Polynomial |
163
click to vote
ICDT
2007
ACM
16 years 16 days 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....
194
click to vote
ACNS
2011
Springer
14 years 10 months ago
2011
Springer
A method for extracting cryptographic key material from DRAM used in modern computers has been recently proposed in [9]; the technique was called Cold Boot attacks. When considerin...
206
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
147
click to vote
JSC
2007
15 years 6 months ago
2007
We present a new algorithm for the computation of resultants associated with multihomogeneous (and, in particular, homogeneous) polynomial equation systems using straight-line pro...
144
click to vote
SODA
2010
ACM
15 years 4 months ago
2010
ACM
Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an efficient algorithm for sampling a giv...