Sciweavers

2853 search results - page 225 / 571
» On Coherence in Computer Algebra
Sort
View
CONCUR
2001
Springer
15 years 10 months ago
Symbolic Computation of Maximal Probabilistic Reachability
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
BIRTHDAY
2008
Springer
15 years 8 months ago
Models of Computation: A Tribute to Ugo Montanari's Vision
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...
Roberto Bruni, Vladimiro Sassone
COMBINATORICS
2004
102views more  COMBINATORICS 2004»
15 years 5 months ago
Satisfiability and Computing van der Waerden Numbers
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive...
Michael R. Dransfield, Lengning Liu, Victor W. Mar...
MOC
2002
113views more  MOC 2002»
15 years 5 months ago
Computation of several cyclotomic Swan subgroups
Let Cl(OK [G]) denote the locally free class group, that is the group of stable isomorphism classes of locally free OK [G]-modules, where OK is the ring of algebraic integers in th...
Timothy Kohl, Daniel R. Replogle
JCS
2010
121views more  JCS 2010»
15 years 4 months ago
Computational soundness of symbolic zero-knowledge proofs
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...
Michael Backes, Dominique Unruh