1383 search results - page 182 / 277 » On the Complexity of the Interlace Polynomial |
229
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...
154
click to vote
EUROCRYPT
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We introduce VSH, very smooth hash, a new S-bit hash function that is provably collision-resistant assuming the hardness of finding nontrivial modular square roots of ver...
165
click to vote
STACS
2000
Springer
15 years 10 months ago
2000
Springer
We show that there is a set that is almost complete but not complete under polynomial-time many-one (p-m) reductions for the class E of sets computable in deterministic time 2lin ...
149
click to vote
TAPSOFT
1991
Springer
15 years 10 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 ...
170
click to vote
AIPS
2007
15 years 8 months ago
2007
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial time algorithm that uses macros to generate pla...