300 search results - page 17 / 60 » An extension of the Cayley-Sylvester formula |
ICDE
2010
IEEE
14 years 2 months ago
2010
IEEE
Abstract— Developing a full-fledged cost-based XQuery optimizer is a fairly complex task. Nowadays, there is little knowledge concerning suitable cost formulae and optimization ...
FOSSACS
2007
Springer
14 years 2 months ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
MOZ
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Extensible Dependency Grammar (XDG) is a graph description language whose formulas can be solved by constraint programming. XDG is designed so as to yield a declarative a...
EUROCRYPT
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. We generalize the Weil descent construction of the GHS attack to arbitrary Artin-Schreier extensions. We give a formula for the characteristic polynomial of Frobenius of ...
CSFW
1999
IEEE
14 years 6 days ago
1999
IEEE
We propose an efficient automatic checking algorithm, Athena, for analyzing security protocols. Athena incorporates a logic that can express security properties including authenti...