Sciweavers

4378 search results - page 58 / 876
» On the Complexity of Ordered Colourings
Sort
View
ECCC
2006
41views more  ECCC 2006»
13 years 9 months ago
On a syntactic approximation to logics that capture complexity classes
We formulate a formal syntax of approximate formulas for the logic with counting quantifiers, SOLP, studied by us in [1], where we showed the following facts: (i) In the presence ...
Argimiro Arratia, Carlos E. Ortiz
ISSAC
1990
Springer
65views Mathematics» more  ISSAC 1990»
14 years 28 days ago
Complexity of Irreducibility Testing for a System of Linear Ordinary Differential Equations
Let a system of linear ordinary differential equations of the first order Y' = AY be given, where A is n x n matrix over a field F(X), assume that the degree degx(A) < d a...
Dima Grigoriev
EURODAC
1995
IEEE
156views VHDL» more  EURODAC 1995»
14 years 14 days ago
VHDL quality: synthesizability, complexity and efficiency evaluation
With VHDL models increasing their size, it becomes more important to assure the quality of these descriptions in order to improve simulation performances, to make project maintain...
M. Mastretti
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...
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
14 years 9 months ago
A new efficient probabilistic model for mining labeled ordered trees
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhi...