Sciweavers

3145 search results - page 143 / 629
» Algebraic Linear Orderings
Sort
View
ESA
2004
Springer
139views Algorithms» more  ESA 2004»
15 years 9 months ago
Comparing Real Algebraic Numbers of Small Degree
We study polynomials of degree up to 4 over the rationals or a computable real subfield. Our motivation comes from the need to evaluate predicates in nonlinear computational geome...
Ioannis Z. Emiris, Elias P. Tsigaridas
FUIN
2006
103views more  FUIN 2006»
15 years 4 months ago
A Categorical View on Algebraic Lattices in Formal Concept Analysis
Formal concept analysis has grown from a new branch of the mathematical field of lattice theory to a widely recognized tool in Computer Science and elsewhere. In order to fully be...
Pascal Hitzler, Markus Krötzsch, Guo-Qiang Zh...
ENTCS
2007
132views more  ENTCS 2007»
15 years 4 months ago
The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads
Lawvere theories and monads have been the two main category theoretic formulations of universal algebra, Lawvere theories arising in 1963 and the connection with monads being esta...
Martin Hyland, John Power
ACL
1992
15 years 5 months ago
Handling Linear Precedence Constraints by Unification
Linear precedence (LP) rules are widely used for stating word order principles. They have been adopted as constraints by HPSG but no encoding in the formalism has been provided. S...
Judith Engelkamp, Gregor Erbach, Hans Uszkoreit
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
15 years 9 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic