900 search results - page 44 / 180 » On Polynomial Time Computation over Unordered Structures |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
RECOMB
2004
Springer
14 years 9 months ago
2004
Springer
We present new methods for reconstructing reticulate evolution of species due to events such as horizontal transfer or hybrid speciation; both methods are based upon extensions of...
AI
2007
Springer
13 years 9 months ago
2007
Springer
We present an efficient algorithm that checks the consistency of partial descriptions of ordered trees. The constraint language of these descriptions was introduced by Cornell in c...
HYBRID
2009
Springer
14 years 24 days ago
2009
Springer
Abstract. In this paper we propose a trajectory based reachability analysis by using local finite-time invariance property. Trajectory based analysis are based on the execution tra...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...