1226 search results - page 137 / 246 » Proofs, Programs and Abstract Complexity |
168
click to vote
TCSB
2010
15 years 5 months ago
2010
Abstract. The process through which disordered components spontaneously arrange themselves into patterns is called self-assembly. Molecular self-assembly describes the process by w...
185
click to vote
ERSHOV
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We consider the problem of query containment for conjunctive queries with safe negation property. A necessary and sufficient condition for two queries to be in containmen...
162
click to vote
ADAEUROPE
2007
Springer
16 years 27 days ago
2007
Springer
Modernlarge real-time systems are becoming more complex. Whilst Ada 2005 provides a comprehensive set of programming mechanisms that allow these systems to be implethe abstraction...
145
click to vote
ICALP
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. We study the problem of determining the complexity of optimal comparison-based in-place sorting when the key length, k, is not a constant. We present the first algorithm...
177
Voted
MST
2008
15 years 6 months ago
2008
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...