中国科学院软件研究所机构知识库
Log In
Register
Email:
Passwd
验 证:
换一张
Have you forgotten your password?
Stay signed in
Log In
ALL
Title
Author
Keyword
Sponsors
Type
Publication date
Submitted Time
Subject
Conference Name
Source
Categories
KOS Subject
Advisor
ORCID
Advanced
在结果中检索
Communities
Subjects
All Items
Community
计算机科学国家重点实... [2]
作者
Content Type
会议论文 [2]
Issued Date
Language
英语 [2]
Source
lecture no... [2]
Project
Indexed
其他 [1]
Spnsorship
south cent... [2]
ISCAS OpenIR
Search Results
Help
Item hits:
(Results 1-2 of 2)
Items/Page:
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
Sort:
Select
Author Ascending
Author Descending
Title Ascending
Title Descending
Issue Date Ascending
Issue Date Descending
Submitted Time Ascending
Submitted Time Descending
a computational proof of complexity of some restricted counting problems
[会议论文]
6th Annual Conference on Theory and Applications of Models of Computation, TAMC 2009, Changsha, China, 43969
Cai Jin-Yi
;
Lu Pinyan
;
Xia Mingji
|
approximation and hardness results for label cut and related problems
[会议论文]
6th Annual Conference on Theory and Applications of Models of Computation, TAMC 2009, Changsha, China, 43969
Zhang Peng
;
Cai Jin-Yi
;
Tang Linqing
;
Zhao Wenbo
1
Copyright © 2007-2022
中国科学院软件研究所
-
Feedback
Powered by
CSpace
