期刊


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



全部

2002 2003 2004 2005 2006 2007
2008 2009 2010 2011 2012 2013
2014 2015 2016 2017 2018 2019
2020 2021 2022 2023 2024

2011, vol.412, no.1/2 2011, vol.412, no.11 2011, vol.412, no.12/14 2011, vol.412, no.15 2011, vol.412, no.16 2011, vol.412, no.17
2011, vol.412, no.18 2011, vol.412, no.19 2011, vol.412, no.20 2011, vol.412, no.21 2011, vol.412, no.22 2011, vol.412, no.23
2011, vol.412, no.24 2011, vol.412, no.25 2011, vol.412, no.26 2011, vol.412, no.27 2011, vol.412, no.28 2011, vol.412, no.29
2011, vol.412, no.3 2011, vol.412, no.30 2011, vol.412, no.31 2011, vol.412, no.32 2011, vol.412, no.33 2011, vol.412, no.34
2011, vol.412, no.35 2011, vol.412, no.36 2011, vol.412, no.37 2011, vol.412, no.38 2011, vol.412, no.39 2011, vol.412, no.4/5
2011, vol.412, no.40 2011, vol.412, no.41 2011, vol.412, no.42 2011, vol.412, no.43 2011, vol.412, no.44 2011, vol.412, no.45
2011, vol.412, no.46 2011, vol.412, no.47 2011, vol.412, no.48 2011, vol.412, no.50 2011, vol.412, no.51 2011, vol.412, no.52
2011, vol.412, no.6 2011, vol.412, no.7 2011, vol.412, no.8/10

题名作者出版年年卷期
Efficient and accurate computation of upper bounds of approximation errorsS. Chevillard; J. Harrison; M. Joldes; Ch. Lauter20112011, vol.412, no.16
Computing monodromy via continuation methods on random Riemann surfacesAndre Galligo; Adrien Poteaux20112011, vol.412, no.16
A note on Gao's algorithm for polynomial factorizationCarlos Hoppen; Virginia M. Rodrigues; Vilmar Trevisan20112011, vol.412, no.16
Parallel QR processing of Generalized Sylvester matricesM. Kourniotis; M. Mitrouli; D. Triantafyllou20112011, vol.412, no.16
Dynamic normal forms and dynamic characteristic polynomialGudmund Skovbjerg Frandsen; Piotr Sankowski20112011, vol.412, no.16
Optimizing n-variate (n + k)-nomials for small kPhilippe Pebay; J. Maurice Rojas; David C. Thompson20112011, vol.412, no.16
Sparse interpolation of multivariate rational functionsAnnie Cuyt; Wen-shin Lee20112011, vol.412, no.16