Sciweavers

2853 search results - page 399 / 571
» On Coherence in Computer Algebra
Sort
View
AML
1999
86views more  AML 1999»
14 years 9 months ago
Subrecursive functions on partial sequences
The paper studies a domain theoretical notion of primitive recursion over partial sequences in the context of Scott domains. Based on a non-monotone coding of partial sequences, t...
Karl-Heinz Niggl
IPL
2002
118views more  IPL 2002»
14 years 9 months ago
Lower bounds for approximate polygon decomposition and minimum gap
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
Joachim Gudmundsson, Thore Husfeldt, Christos Levc...
85
Voted
ECCC
1998
117views more  ECCC 1998»
14 years 9 months ago
Determinant: Old Algorithms, New Insights
In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of...
Meena Mahajan, V. Vinay
JUCS
2002
113views more  JUCS 2002»
14 years 9 months ago
The Origins and the Development of the ASM Method for High Level System Design and Analysis
: The research belonging to the Abstract State Machines approach to system design and analysis is surveyed and documented in an annotated ASM bibliography. The survey covers the pe...
Egon Börger
104
Voted
LICS
2010
IEEE
14 years 8 months ago
A Sound and Complete Calculus for Finite Stream Circuits
Stream circuits are a convenient graphical way to represent streams (or stream functions) computed by finite dimensional linear systems. We present a sound and complete expression...
Stefan Milius