1730 search results - page 154 / 346 » Algebra and Computation |
COCO
2007
Springer
15 years 7 months ago
2007
Springer
Valiant has proposed a new theory of algorithmic computation based on perfect matchings and Pfaffians. We study the properties of matchgates—the basic building blocks in this n...
113
click to vote
CONCUR
2001
Springer
15 years 5 months ago
2001
Springer
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
110
click to vote
BIRTHDAY
2008
Springer
15 years 3 months ago
2008
Springer
e [43] is the first paper on final, observational semantics in abstract data types, and the main reference for one of the MoC contributed papers in this volume. It presented severa...
98
Voted
COMBINATORICS
2004
15 years 24 days ago
2004
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive...
108
Voted
JCS
2010
14 years 11 months ago
2010
raction of cryptographic operations by term algebras, called Dolev-Yao models, is essential in almost all tool-supported methods for proving security protocols. Recently significa...