896 search results - page 78 / 180 » On completeness of word reversing |
134
click to vote
GC
2008
Springer
15 years 26 days ago
2008
Springer
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...
79
Voted
IPL
2008
15 years 24 days ago
2008
This paper studies the equational theory of prebisimilarity, a bisimulation-based preorder introduced by Hennessy and Milner in the early 1980s, over basic CCS with the divergent ...
107
Voted
INFORMATICALT
2006
15 years 23 days ago
2006
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...
97
Voted
ENTCS
2007
15 years 23 days ago
2007
This article describes an architecture for creating responsive web interfaces for proof assistants. The architecture combines current web development technologies with the functio...
91
Voted
ENTCS
2007
15 years 23 days ago
2007
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...