1650 search results - page 28 / 330 » The HOM problem is decidable |
141
click to vote
FROCOS
2007
Springer
15 years 10 months ago
2007
Springer
In abstract algebra, a structure is said to be Noetherian if it does not admit infinite strictly ascending chains of congruences. In this paper, we adapt this notion to first-ord...
122
click to vote
CSL
2009
Springer
15 years 10 months ago
2009
Springer
We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with ω-regular objectives.While the existence of an equilibrium whose payoff fal...
138
Voted
JACM
2002
15 years 3 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
133
Voted
FORMATS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We study the realizability problem for specifications of reactive systems expressed in real-time linear temporal logics. The logics we consider are subsets of MITL (Metr...
151
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message M can be deduced from a set of messages under the theory of ...