896 search results - page 57 / 180 » On completeness of word reversing |
84
Voted
ESOP
2003
Springer
15 years 6 months ago
2003
Springer
Previous methods have generally identified the location of a type error as a particular program point or the program subtree rooted at that point. We present a new approach that ...
143
Voted
FOSSACS
2006
Springer
15 years 4 months ago
2006
Springer
In recent years, a tight connection has emerged between modal logic on the one hand and coalgebras, understood as generic transition systems, on the other hand. Here, we prove tha...
101
click to vote
DM
2007
15 years 21 days ago
2007
: For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest integer n such that for any graph G of order n, either G contains G1 or the complement of G contains G...
115
click to vote
IPL
2007
15 years 19 days ago
2007
In this paper, we consider the parameterized complexity of the following problem: Given a hereditary property P on digraphs, an input digraph D and a positive integer k, does D ha...
83
Voted
IANDC
2010
14 years 11 months ago
2010
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...