1650 search results - page 230 / 330 » The HOM problem is decidable |
167
click to vote
CCIA
2007
Springer
16 years 16 days ago
2007
Springer
With the arrival of high throughput genotyping techniques, the detection of likely genotyping errors is becoming an increasingly important problem. In this paper we are interested...
182
click to vote
STACS
2005
Springer
15 years 11 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
140
click to vote
SIGECOM
2004
ACM
15 years 11 months ago
2004
ACM
When donating money to a (say, charitable) cause, it is possible to use the contemplated donation as negotiating material to induce other parties interested in the charity to dona...
179
click to vote
AMEC
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Many practical scenarios involve solving a social choice problem: a group of self-interested agents have to agree on an outcome that best fits their combined preferences...
152
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
For the whole class of linear term rewriting systems and for each integer k, we define k-bounded rewriting as a restriction of the usual notion of rewriting. We show that the k-bo...