128 search results - page 7 / 26 » Applying IC-Scheduling Theory to Familiar Classes of Computa... |
LICS
2005
IEEE
14 years 1 months ago
2005
IEEE
We investigate model theoretic characterisations of the expressive power of modal logics in terms of bisimulation invariance. The paradigmatic result of this kind is van Benthemā...
SOFSEM
2000
Springer
13 years 11 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Gaifmanās locality theorem states that every ļ¬rst-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...
CIE
2006
Springer
13 years 11 months ago
2006
Springer
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...
GC
2010
Springer
13 years 6 months ago
2010
Springer
Intriguing and tight sets of vertices of point-line geometries have recently been studied in the literature. In this paper, we indicate a more general framework for dealing with t...