2181 search results - page 144 / 437 » The restriction scaffold problem |
79
Voted
OOPSLA
2009
Springer
15 years 7 months ago
2009
Springer
Multiple inheritance has long been plagued with the “diamond” inheritance problem, leading to solutions that restrict expressiveness, such as mixins and traits. Instead, we ad...
97
Voted
COCO
2007
Springer
15 years 7 months ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
81
Voted
CPM
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Detecting historical recombination is an important computational problem which has received great attention recently. Due to recombination, input sequences form a mosaic,...
107
Voted
FCT
2005
Springer
15 years 6 months ago
2005
Springer
Leftist grammars can be characterized in terms of rules of the form a → ba and cd → d, without distinction between terminals and nonterminals. They were introduced by Motwani e...
WG
2005
Springer
15 years 6 months ago
2005
Springer
To decide whether a line graph (hence a claw-free graph) of maximum degree five admits a stable cutset has been proven to be an NP-complete problem. The same result has been known...