828 search results - page 17 / 166 » Bounded Hairpin Completion |
COCOON
2007
Springer
15 years 6 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
88
Voted
HPCA
2009
IEEE
16 years 1 months ago
2009
IEEE
The verification of an execution against memory consistency is known to be NP-hard. This paper proposes a novel fast memory consistency verification method by identifying a new na...
98
Voted
STACS
2010
Springer
15 years 7 months ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
109
Voted
DM
2000
15 years 8 days ago
2000
Word reversing is a combinatorial operation on words that detects pairs of equivalent words in monoids that admit a presentation of a certain form. Here we give conditions for this...
97
Voted
CORR
2004
Springer
15 years 9 days ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...