|
|||||
|
|
A note on the hardness of Skolem-type sequences |
|
| Authors: | Gustav Nordh |
| Institution: | Department of Computer and Information Science, Linköpings Universitet, S-581 83 Linköping, Sweden |
| Abstract: | The purpose of this note is to give upper bounds (assuming  different from  ) on how far the generalizations of Skolem sequences can be taken while still hoping to resolve the existence question. We prove that the existence questions for both multi-Skolem sequences and generalized Skolem sequences are strongly  -complete. These results are significant strengthenings and simplifications of the recent  -completeness result for generalized multi-Skolem sequences. |
| Keywords: | Skolem sequence _method=retrieve& _eid=1-s2 0-S0166218X10000181& _mathId=si5 gif& _pii=S0166218X10000181& _issn=0166218X& _acct=C000053510& _version=1& _userid=1524097& md5=2ef838ef7d16fe9e1929490866152eb6')" style="cursor:pointer |
| 本文献已被 ScienceDirect 等数据库收录！ | |