3172 search results - page 374 / 635 » On the Random-Self-Reducibility of Complete Sets |
158
click to vote
ENTCS
2008
15 years 6 months ago
2008
We propose String MultiSet Rewriting (SMSR) as an intermediate language for simulation of biomolecular systems. Higher level formalisms for biological systems description can be t...
202
click to vote
GC
2008
Springer
15 years 6 months 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...
186
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We present a decomposition-based approach to managing probabilistic information. We introduce world-set decompositions (WSDs), a space-efficient and complete representation system ...
175
click to vote
ENTCS
2007
15 years 6 months ago
2007
This paper studies the notion of “freshness” that often occurs in the meta-theory of computer science languages involving various kinds of names. Nominal Equational Logic is a...
175
click to vote
NLE
2008
15 years 6 months ago
2008
Morphological analysis is a crucial component of several natural language processing tasks, especially for languages with a highly productive morphology, where stipulating a full ...