Sciweavers

25 search results - page 2 / 5
» On the algebraic numbers computable by some generalized Ehre...
Sort
View
COCO
2005
Springer
106views Algorithms» more  COCO 2005»
13 years 11 months ago
The Complexity of the Inertia and Some Closure Properties of GapL
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
Thanh Minh Hoang, Thomas Thierauf
ACS
2008
13 years 5 months ago
Algebras Versus Coalgebras
Algebras and coalgebras are fundamental notions for large parts of mathematics. The basic constructions from universal algebra are now expressed in the language of categories and ...
Robert Wisbauer
FOCS
2006
IEEE
13 years 11 months ago
Algebraic Structures and Algorithms for Matching and Matroid Problems
We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our wo...
Nicholas J. A. Harvey
ADG
1998
Springer
127views Mathematics» more  ADG 1998»
13 years 9 months ago
Decomposing Algebraic Varieties
Abstract. This paper describes a complete implementation of Ritt-Wu's characteristic sets method in the Maple system. The implemented algorithms include those with variants fo...
Dongming Wang
ICALP
2005
Springer
13 years 11 months ago
Petri Algebras
The firing rule of Petri nets relies on a residuation operation for the commutative monoid of natural numbers. We identify a class of residuated commutative monoids, called Petri ...
Eric Badouel, Jules Chenou, Goulven Guillou