中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR

Search Results

Help

Item hits: (Results 1-4 of 4)

Items/Page:    Sort:
A New Efficient Algorithm for Computing All Low Degree Annihilators of Sparse Polynomials with a High Number of Variables [会议论文]
The Sixth International Conference on Information Security Practice and Experience Conference (ISPEC 2010), Seoul, Korea, 2010-5-12~2010-05-13
Lin Xu; Dongdai Lin; Xin Li
  |  
 
holographic algorithms with matchgates capture precisely tractable planar #csp [会议论文]
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010, Las Vegas, NV, United states, 40839
Cai Jin-Yi; Lu Pinyan; Xia Mingji
  |  
 
a new efficient algorithm for computing all low degree annihilators of sparse polynomials with a high number of variables [会议论文]
6th International Conference on Information Security Practice and Experience, Seoul, SOUTH KOREA, MAY 12-13,
Xu Lin; Lin Dongdai; Li Xin
  |  
 
finding relations among linear constraints [会议论文]
8th International Conference on Artificial Intelligence and Symbolic Computation, Beijing, PEOPLES R CHINA, SEP 20-22,
Yan Jun; Zhang Jian; Xu Zhongxing
  |  
 

1

 

Valid XHTML 1.0!
Copyright © 2007-2021  中国科学院软件研究所 - Feedback
Powered by CSpace