Sciweavers

264 search results - page 26 / 53
» Decomposing Algebraic Varieties
Sort
View
ICALP
2007
Springer
14 years 15 days ago
Affine Systems of Equations and Counting Infinitary Logic
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
Albert Atserias, Andrei A. Bulatov, Anuj Dawar
LOGCOM
2010
152views more  LOGCOM 2010»
13 years 3 months ago
Constructive Logic with Strong Negation as a Substructural Logic
Gentzen systems are introduced for Spinks and Veroff's substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has b...
Manuela Busaniche, Roberto Cignoli
VLDB
1997
ACM
93views Database» more  VLDB 1997»
14 years 23 days ago
A Language for Manipulating Arrays
This paper describes the Array Manipulation Language (AML), an algebra for multidimensional array data. AML is generic, in the sense that it can be customized to support a wide va...
Arunprasad P. Marathe, Kenneth Salem
JC
2006
105views more  JC 2006»
13 years 8 months ago
On the complexity of the resolvent representation of some prime differential ideals
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
Lisi D'Alfonso, Gabriela Jeronimo, Pablo Solern&oa...
JGAA
2007
93views more  JGAA 2007»
13 years 8 months ago
Large-Graph Layout Algorithms at Work: An Experimental Study
In the last decade several algorithms that generate straight-line drawings of general large graphs have been invented. In this paper we investigate some of these methods that are ...
Stefan Hachul, Michael Jünger