155 search results - page 31 / 31 » Bounded Arithmetic and Descriptive Complexity |
SIGSOFT
2007
ACM
14 years 6 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
COMPGEOM
2010
ACM
13 years 10 months ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
FOSSACS
2001
Springer
13 years 10 months ago
2001
Springer
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
BMCBI
2008
13 years 5 months ago
2008
Background: Detailed information about protein interactions is critical for our understanding of the principles governing protein recognition mechanisms. The structures of many pr...
ICDT
2012
ACM
11 years 7 months ago
2012
ACM
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...