云南高校图书馆联盟文献共享服务平台- POLYNOMIAL-TIME

POLYNOMIAL-TIME: 作品数：22被引量：17H指数：3; 导出分析报告; 相关作者：李雅瑞更多>>; 相关机构：桂林空军学院更多>>; 相关期刊：《IEEE/CAA Journal of Automatica Sinica》《Science Bulletin》《Journal of Computer Science & Technology》《Journal of Electronics(China)》更多>>; 相关基金：国家自然科学基金国家重点基础研究发展计划广东省自然科学基金上海市教育委员会重点学科基金更多>>

Polynomial-Time Key-Recovery Attacks Against NTRURe Encrypt from ASIACCS'15: 《Journal of Systems Science & Complexity》2024年第3期1308-1325,共18页LIU Zhen PAN Yanbin ZHENG Jinwei; supported by National Key Research and Development Program of China under Grant No.2018YFA0704705;the National Natural Science Foundation of China under Grant Nos. 62032009, 12201193;12226006;the Innovation Program for Quantum Science and Technology under Grant No. 2021ZD0302902;the Innovation Group Project of the Natural Science Foundation of Hubei Province of China under Grant No.2023AFA021;the Science and Technology Research Program of Education Department of Hubei Province under Grant No. Q20221008。; In ASIACCS 2015, Nu nez, et al. proposed a proxy re-encryption scheme, named NTRURe Encrypt, based on NTRU, which allows a proxy to translate ciphertext under the delegator’s public key into a re-encrypted ciphertext...; 关键词：Broadcast attack key recovery NTRU NTRUReEncrypt

Optimizing Polynomial-Time Solutions to a Network Weighted Vertex Cover Game被引量：1: 《IEEE/CAA Journal of Automatica Sinica》2023年第2期512-523,共12页Jie Chen Kaiyi Luo Changbing Tang Zhao Zhang Xiang Li; partly supported by the National Natural Science Foundation of China(61751303,U20A2068,11771013);the Zhejiang Provincial Natural Science Foundation of China(LD19A010001);the Fundamental Research Funds for the Central Universities。; Weighted vertex cover(WVC)is one of the most important combinatorial optimization problems.In this paper,we provide a new game optimization to achieve efficiency and time of solutions for the WVC problem of weighted n...; 关键词：Game-based asynchronous algorithm(GAA) game optimization polynomial time strict Nash equilibrium(SNE) weighted vertex cover(WVC)

Polynomial-Time Assignment-Based Cell Association with Generic Utility Functions: 《China Communications》2022年第9期214-228,共15页Lusheng Wang Chao Fang Hai Lin Min Peng Caihong Kai; the results of the research project funded by the National Natural Science Foundation of China under Grant No.61971176;in part by the Applied Basic Research Program of Wuhan City under grand 2017010201010117。; Cell association is a significant research issue in future mobile communication systems due to the unacceptably large computational time of traditional schemes.This article proposes a polynomial-time cell association ...; 关键词：mobile communication system 2-dimensional assignment problem hungarian algorithm FAIRNESS cell association

SAT in P Does Not Imply Chaos in the Security System: 《Journal of Computer and Communications》2022年第10期122-148,共27页Dato Ruiz Juan Manuel; There are a large number of papers that claim that there are problems that once solved lead to an efficient solution of a wide range of problems, classified as NP. In this paper we will not only question the existence...; 关键词：NP-Co Problems SAT Polynomial-Time Solution

Approximation Algorithms for Vertex Happiness: 《Journal of the Operations Research Society of China》2019年第3期429-448,共20页Yao Xu Yong Chen Peng Zhang Randy Goebel; the National Natural Science Foundation of China(Nos.11771114,11571252,and 61672323);the China Scholarship Council(No.201508330054);the Natural Science Foundation of Shandong Province(No.ZR2016AM28);the Natural Sciences and Engineering Research Council of Canada.; We investigate the maximum happy vertices(MHV)problem and its complement,the minimum unhappy vertices(MUHV)problem.In order to design better approximation algorithms,we introduce the supermodular and submodular multi-...; 关键词：Vertex happiness Multi-labeling Submodular/supermodular set function Approximation algorithm Polynomial-time reduction Integrality gap

Quantum Polynomial-Time Fixed-Point Attack for RSA被引量：3: 《China Communications》2018年第2期25-32,共8页Yahui Wang Huanguo Zhang Houzhen Wang; partially supported by he State Key Program of National Natural Science of China No. 61332019;Major State Basic Research Development Program of China (973 Program) No. 2014CB340601;the National Science Foundation of China No. 61202386, 61402339;the National Cryptography Development Fund No. MMJJ201701304; Security analysis of public-key cryptosystems is of fundamental significance for both theoretical research and applications in cryptography. In particular, the security of widely used public-key cryptosystems merits d...; 关键词：information security cryptogra-phy RSA fixed-point quantum computing

Polynomial-time verification of diagnosability of fuzzy discrete event systems被引量：6: 《Science China(Information Sciences)》2014年第6期270-279,共10页LIU FuChun; supported by National Natural Science Foundation of China(Grant Nos.60974019,61273118);High-level Talents Project of Guangdong Province;Natural Science Foundation of Guangdong Province(Grant No.S2012010010570); A fuzzy approach to perform diagnosis of fuzzy discrete event systems（FDESs）is proposed by constructing diagnosers,which may more effectively cope with the problems of vagueness and fuzziness arising from failure di...; 关键词：discrete event systems fuzzy finite automata failure diagnosis polynomial complexity

Risk Models for the Prize Collecting Steiner Tree Problems with Interval Data: 《Acta Mathematicae Applicatae Sinica》2014年第1期1-26,共26页Eduardo lvarez-Miranda Alfredo Candia-Vjar Xu-jin CHEN Xiao-dong HU Bi LI; Supported in part by the National Natural Science Foundation of China under Grant No.11021161 and 10928102;973 Program of China under Grant No.2011CB80800;Chinese Academy of Sciences under Grant No.kjcx-yw-s7,project grant of"Center for Research and Applications in Plasma Physics and Pulsed Power Technology,PBCT-Chile-ACT 26";Direccio'n de Programas de Investigaci'ón,Universidad de Talca,Chile; Given a connected graph G=（V,E）with a nonnegative cost on each edge in E,a nonnegative prize at each vertex in V,and a target set V′V,the Prize Collecting Steiner Tree（PCST）problem is to find a tree T in G interc...; 关键词：uncertainty modeling prize collecting Steiner tree interval data series-parallel graphs polynomial-time solvability

Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP: 《Science China(Information Sciences)》2014年第1期146-159,共14页LI HongDa FENG DengGuo; partially supported by National Basic Research Program of China(973 program)(Grant No.2007CB311202);National Natural Science Foundation of China(Grant No.60970139);Strategic Priority Program of Chinese Academy of Sciences(Grant No.XDA06010702);IIEs Cryptography Research Project; Barak and Lindell showed that there exist constant-round zero-knowledge arguments of knowledge with strict polynomial-time extractors. This leaves the open problem of whether it is possible to obtain an analogous resu...; 关键词：zero-knowledge proofs proofs of knowledge constant-round strict polynomial-time extractors

Polynomial-Time Adaptive Routing Algorithm Based on Spectrum Scan in Dynamic Flexible Optical Networks: 《China Communications》2013年第4期49-58,共10页刘阳华楠郑小平张汉一周炳琨; supported in part by projects of National 863 Program under Grant No.2012AA011301;National 973 Program under Grants No. 2010CB328203, No. 2010CB328205;National Natural Science Foundation of China under Grant No. 61201188; Optical Orthogonal Frequency Division Multiplexing (OOFDM) has been proposed as a highly spectrum-efficient modulation technique, which can provide flexible spectrum assignment with fine granularity. In OOFDM-based fl...; 关键词：optical orthogonal frequency di-vision multiplexing routing and spectrumassignment computational complexity block-ing probability resource utilization

高级检索 检索式检索

时间限定

期刊范围

学科限定全选

高级检索 检索式检索

时间限定

期刊范围

学科限定全选

POLYNOMIAL-TIME

检索结果分析

下载全文

高级检索检索式检索

时间限定

期刊范围

学科限定全选

高级检索 检索式检索

时间限定

期刊范围

学科限定全选

POLYNOMIAL-TIME

检索结果分析

下载全文

用户登录

高级检索检索式检索