Shortest consistent superstrings computable in polynomial time
- 作者Tao Jiang; Vadim G. Timkovsky
- 卷第143卷
- 期第1期
- 印刷ISSN0304-3975
- 文件大小648.72KB
- 发表时间1995
- DOI10.1016/0304-3975(95)80027-7
- 页码113-122
同作者推荐
Effective Borel measurability and reducibility of functionsVasco Brattka · 2005
Editorial: Math. Log. Quart. 5/2008Vasco Brattka; Hajime Ishihara; Matthias Schröder; Ning Zhong · 2008
Feasible Real Random Access MachinesVasco Brattka; Peter Hertling · 1998
PrefaceVasco Brattka; Ruth Dillhage; Tanja Grubba; Angela Klutsch · 2008
Computability in linear algebraMartin Ziegler; Vasco Brattka · 2004
Topological properties of real number representationsVasco Brattka; Peter Hertling · 2002
Recursive quasi-metric spacesVasco Brattka · 2003
Computability on subsets of metric spacesVasco Brattka; Gero Presser · 2003