Sciweavers

1507 search results - page 53 / 302
» Separating Complexity Classes Using Structural Properties
Sort
View
BIRTHDAY
2010
Springer
13 years 11 months ago
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
Martin Grohe
COSIT
2005
Springer
132views GIS» more  COSIT 2005»
14 years 3 months ago
Structure and Semantics of Arrow Diagrams
Arrows are major components of diagrams, where they are typically used to facilitate the communication of spatial and temporal knowledge. An automated interpretation of arrow diagr...
Yohei Kurata, Max J. Egenhofer
DC
2010
13 years 4 months ago
Closing the complexity gap between FCFS mutual exclusion and mutual exclusion
First-Come-First-Served (FCFS) mutual exclusion (ME) is the problem of ensuring that processes attempting to concurrently access a shared resource do so one by one, in a fair order...
Robert Danek, Wojciech M. Golab
TOSEM
2002
153views more  TOSEM 2002»
13 years 9 months ago
Automated abstraction of class diagrams
d Abstraction of Class Diagrams ALEXANDER EGYED Teknowledge Corporation Designers can easily become overwhelmed with details when dealing with large class diagrams. icle presents a...
Alexander Egyed
LICS
2008
IEEE
14 years 4 months ago
From Automatic Structures to Borel Structures
We study the classes of B¨uchi and Rabin automatic structures. For B¨uchi (Rabin) automatic structures their domains consist of infinite strings (trees), and the basic relation...
Greg Hjorth, Bakhadyr Khoussainov, Antonio Montalb...