1650 search results - page 123 / 330 » The HOM problem is decidable |
108
click to vote
LICS
2010
IEEE
15 years 2 months ago
2010
IEEE
We solve the open problem of the decidability of Boolean BI logic (BBI), which can be considered as the core of separation and spatial logics. For this, we define a complete phas...
142
click to vote
LOGCOM
2010
15 years 2 months ago
2010
Public announcement logic extends multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. In thi...
153
click to vote
FSTTCS
2010
Springer
15 years 2 months ago
2010
Springer
Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5 ), thus improving...
153
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We show that any quantum algorithm to decide whether a function f : [n] → [n] is a permutation or far from a permutation must make Ω n1/3 /w queries to f, even if the algorith...
340
click to vote
CPM
2011
Springer
14 years 7 months ago
2011
Springer
A binary matrix has the Consecutive-Ones Property (C1P) if its columns can be ordered in such a way that all 1’s in each row are consecutive. We consider here a variant of the C1...