知识中心主页
文献服务
文献资源
外文期刊
外文会议
专业机构
智能制造
高级检索
版权声明
使用帮助
期刊
ISSN
0304-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
2018, vol.705
2018, vol.706
2018, vol.707
2018, vol.708
2018, vol.709
2018, vol.710
2018, vol.711
2018, vol.712
2018, vol.713
2018, vol.714
2018, vol.715
2018, vol.716
2018, vol.717
2018, vol.718
2018, vol.719
2018, vol.720
2018, vol.721
2018, vol.722
2018, vol.723
2018, vol.724
2018, vol.725
2018, vol.726
2018, vol.727
2018, vol.728
2018, vol.729
2018, vol.730
2018, vol.731
2018, vol.732
2018, vol.733
2018, vol.734
2018, vol.735
2018, vol.736
2018, vol.737
2018, vol.738
2018, vol.739
2018, vol.740
2018, vol.741
2018, vol.742
2018, vol.743
2018, vol.744
2018, vol.745
2018, vol.746
2018, vol.747
2018, vol.748
2018, vol.749
2018, vol.750
2018, vol.751
2018, vol.752
题名
作者
出版年
年卷期
Bivariate complexity analysis of
Almost Forest Deletion
Ashutosh Rai; Saket Saurabh
2018
2018, vol.708
The maximum time of 2-neighbor bootstrap percolation: Complexity results
Thiago Marcilon; Rudini Sampaio
2018
2018, vol.708
Editorial Board
2018
2018, vol.708
Efficient merged longest common subsequence algorithms for similar sequences
Kuo-Tsung Tseng; De-Sheng Chan; Chang-Biau Yang; Shou-Fu Lo
2018
2018, vol.708
Sums of read-once formulas: How many summands are necessary?
Meena Mahajan; Anuj Tawari
2018
2018, vol.708
An iteration method for computing the total number of spanning trees and its applications in graph theory
Bing Yao; Fei Ma
2018
2018, vol.708
A new lower bound for the on-line coloring of intervals with bandwidth
Patryk Mikos
2018
2018, vol.708
A transfer method from bounded existential Diophantine equations to Tarski algebra formulas
B. Litow
2018
2018, vol.708
Structured proportional representation
Nimrod Talmon
2018
2018, vol.708
制造业外文文献服务平台