中国机械工程学会生产工程分会知识服务平台 | sc.gmachineinfo.com

期刊

ISSN	0304-3975
刊名	Theoretical Computer Science
参考译名	理论计算机科学
收藏年代	2002～2024

全部

题名	作者	出版年	年卷期
NP-completeness and APX-completeness of restrained domination in graphs	Lei Chen; Weiming Zeng; Changhong Lu	2012	2012, vol.448
Weakly unambiguous morphisms	Dominik D. Freydenberger; Hossein Nevisi; Daniel Reidenbach	2012	2012, vol.448
Polynomial characteristic sets for DFA identification	Pedro Garcia; Damian Lopez; Manuel Vazquez de Parga	2012	2012, vol.448
An O(m(m + n log n) log(nC))-time algorithm to solve the minimum cost tension problem	Mehdi Ghiyasvand	2012	2012, vol.448
Arithmetic circuits: The chasm at depth four gets wider	Pascal Koiran	2012	2012, vol.448
An extended Earley's algorithm for Petri net controlled grammars without λ rules and cyclic rules	Taishin Y. Nishida	2012	2012, vol.448
Distance transform computation for digital distance functions	Robin Strand; Nicolas Normand	2012	2012, vol.448
Efficient methods for selfish network design	Dimitris Fotakis; Alexis C. Kaporis; Paul G. Spirakis	2012	2012, vol.448
A note on the paper "On Brlek-Reutenauer conjecture"	Bojan Basic	2012	2012, vol.448