A unified approach to computing the nearest complex polynomial with a given zero
- 期刊名称Theoretical Computer Science
- 作者Hu, Wenyu; Luo, Xingjun; Luo, Zhongxuan
- 卷第595卷
- 印刷ISSN0304-3975
- 文件大小414.72KB
- 发表时间2015-08
- DOI10.1016/j.tcs.2015.06.015
- 页码65-81
P automata revisitedPăun, Gheorghe; Pérez-Jiménez, Mario J. · Theoretical Computer Science · 2012
Consistency of multidimensional combinatorial substitutionsJolivet, Timo; Kari, Jarkko · Theoretical Computer Science · 2012
Quantum counterfeit coin problemsIwama, Kazuo; Nishimura, Harumichi; Raymond, Rudy; Teruyama, Junichi · Theoretical Computer Science · 2012
Reversible iterative graph processesDourado, Mitre C.; Penso, Lucia Draque; Rautenbach, Dieter; Szwarcfiter, Jayme L. · Theoretical Computer Science · 2012
Lowness for bounded randomnessDowney, Rod; Ng, Keng Meng · Theoretical Computer Science · 2012
Lower bound for balanced setsNedev, Zhivko · Theoretical Computer Science · 2012
The lattice structure of -player gamesCincotti, Alessandro · Theoretical Computer Science · 2012
Chordal digraphsMeister, Daniel; Telle, Jan Arne · Theoretical Computer Science · 2012