The correspondence problem for metabonomics datasets
✍ Scribed by K. Magnus Åberg; Erik Alm; Ralf J. O. Torgrip
- Publisher
- Springer
- Year
- 2009
- Tongue
- English
- Weight
- 595 KB
- Volume
- 394
- Category
- Article
- ISSN
- 1618-2650
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
It has been shown by Fomin and the author [Soviet Physics JETP 40 (1975), 61 that in the classical limit, fi + 0, there is a correspondence between the quantum and classical electron self-energies in spinor electrodynamics. In the present work this result is extended to the cases of scalar electrody
We shall show that it is decidable for binary instances of the Post Correspondence Problem whether the instance has an inÿnite solution. In this context, a binary instance (h; g) consists of two morphisms h and g with a common two element domain alphabet. An inÿnite solution ! is an inÿnite word ! =
consider the problem of finding a shortest solution for the Post correspondence problem over a unary alphabet. We show that the complexity of this problem heavily depends on the representation of the input: the problem is NP-complete if the input is given in compact (logarithmic) form, whereas it be