Sciweavers

2853 search results - page 163 / 571
» On Coherence in Computer Algebra
Sort
View
FCT
1999
Springer
15 years 8 months ago
Tile Transition Systems as Structured Coalgebras
The aim of this paper is to investigate the relation between two models of concurrent systems: tile rewrite systems and coalgebras. Tiles are rewrite rules with side e ects which a...
Andrea Corradini, Reiko Heckel, Ugo Montanari
AAAI
1990
15 years 5 months ago
Obtaining Quantitative Predictions from Monotone Relationships
: Tasks such as forecasting, diagnosis, and planning frequently require quantitative predictions . Typically, quantitative predictions are obtained by characterizing a system in te...
Joseph L. Hellerstein
GD
2009
Springer
15 years 2 months ago
Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
Ioannis Z. Emiris, Elias P. Tsigaridas, Antonios V...
FOSSACS
2010
Springer
15 years 11 months ago
Incremental Pattern-Based Coinduction for Process Algebra and Its Isabelle Formalization
We present a coinductive proof system for bisimilarity in transition systems specifiable in the de Simone SOS format. Our coinduction is incremental, in that it allows building in...
Andrei Popescu, Elsa L. Gunter
ISSAC
1997
Springer
138views Mathematics» more  ISSAC 1997»
15 years 8 months ago
Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
Erich Kaltofen, Victor Shoup