4370 search results - page 482 / 874 » Algebra of Logic Programming |
113
click to vote
ISSAC
2007
Springer
15 years 10 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
149
Voted
WAOA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...
106
click to vote
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
We provide an answer to an open question, posed by van Glabbeek [4], regarding the axiomatizability of ready trace semantics. We prove that if the alphabet of actions is finite, t...
125
click to vote
CIE
2010
Springer
15 years 8 months ago
2010
Springer
Containers are a semantic way to talk about strictly positive types. In previous work it was shown that containers are closed under various constructions including products, coprod...
112
Voted
FC
1999
Springer
15 years 8 months ago
1999
Springer
In this paper we consider the problem of efficiently locating cryptographic keys hidden in gigabytes of data, such as the complete file system of a typical PC. We describe efficie...