CORR
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. The problem of finding a center string that is "close" to every given string arises in computational molecular biology and coding theory. This problem has two v...
CORR
2000
Springer
13 years 11 months ago
2000
Springer
We show that, in John Conway's board game Phutball (or Philosopher's Football), it is NP-complete to determine whether the current player has a move that immediately wins...
CORR
2000
Springer
13 years 11 months ago
2000
Springer
CORR
2000
Springer
13 years 11 months ago
2000
Springer
CORR
2000
Springer
13 years 11 months ago
2000
Springer
CORR
2000
Springer
13 years 11 months ago
2000
Springer
This paper describes howautomated deduction methods for natural language processing can be applied moreefficiently by encodingcontext in a moreelaborate way. Our workis based on f...
CORR
2000
Springer
13 years 11 months ago
2000
Springer
CORR
2000
Springer
13 years 11 months ago
2000
Springer
CORR
2000
Springer
13 years 11 months ago
2000
Springer
A general notion of algebraic conditional plausibility measures is de ned. Probability measures, ranking functions, possibility measures, and under the appropriate de nitions sets...
CORR
2000
Springer
13 years 11 months ago
2000
Springer
