咨询与建议

限定检索结果

文献类型

  • 20,219 篇 会议
  • 13,195 篇 期刊文献
  • 76 篇 学位论文
  • 73 册 图书
  • 15 篇 科技报告

馆藏范围

  • 33,563 篇 电子文献
  • 21 种 纸本馆藏

日期分布

学科分类号

  • 18,904 篇 工学
    • 11,985 篇 计算机科学与技术...
    • 6,317 篇 电气工程
    • 3,349 篇 信息与通信工程
    • 2,855 篇 软件工程
    • 1,580 篇 控制科学与工程
    • 1,375 篇 电子科学与技术(可...
    • 668 篇 仪器科学与技术
    • 522 篇 机械工程
    • 287 篇 交通运输工程
    • 263 篇 生物工程
    • 237 篇 光学工程
    • 218 篇 材料科学与工程(可...
    • 201 篇 化学工程与技术
    • 198 篇 生物医学工程(可授...
    • 158 篇 航空宇航科学与技...
    • 146 篇 力学(可授工学、理...
    • 128 篇 动力工程及工程热...
  • 8,414 篇 理学
    • 6,191 篇 数学
    • 1,558 篇 物理学
    • 888 篇 统计学(可授理学、...
    • 580 篇 系统科学
    • 486 篇 生物学
    • 228 篇 化学
  • 1,990 篇 管理学
    • 1,709 篇 管理科学与工程(可...
    • 303 篇 工商管理
    • 275 篇 图书情报与档案管...
  • 624 篇 医学
    • 456 篇 临床医学
    • 159 篇 基础医学(可授医学...
  • 280 篇 经济学
    • 188 篇 应用经济学
  • 166 篇 法学
    • 134 篇 社会学
  • 140 篇 农学
  • 131 篇 文学
  • 75 篇 教育学
  • 67 篇 哲学
  • 57 篇 军事学
  • 24 篇 艺术学
  • 9 篇 历史学

主题

  • 33,578 篇 computational co...
  • 2,187 篇 computational mo...
  • 1,102 篇 algorithm design...
  • 977 篇 polynomials
  • 945 篇 decoding
  • 906 篇 computer science
  • 883 篇 convergence
  • 883 篇 signal processin...
  • 619 篇 motion estimatio...
  • 607 篇 robustness
  • 598 篇 encoding
  • 585 篇 video coding
  • 582 篇 mimo
  • 569 篇 signal processin...
  • 530 篇 optimization
  • 514 篇 computer archite...
  • 511 篇 ofdm
  • 509 篇 detectors
  • 497 篇 hardware
  • 487 篇 feature extracti...

机构

  • 39 篇 department of el...
  • 32 篇 institute for in...
  • 31 篇 beijing inst tec...
  • 31 篇 school of electr...
  • 28 篇 school of comput...
  • 28 篇 univ chicago dep...
  • 26 篇 department of el...
  • 25 篇 univ elect sci &...
  • 22 篇 national mobile ...
  • 22 篇 school of electr...
  • 21 篇 tsinghua univers...
  • 20 篇 ibm thomas j. wa...
  • 20 篇 univ dusseldorf ...
  • 20 篇 school of inform...
  • 20 篇 institute of com...
  • 20 篇 univ liverpool d...
  • 19 篇 princeton univ d...
  • 19 篇 eindhoven univ t...
  • 19 篇 univ warwick dep...
  • 18 篇 department of el...

作者

  • 62 篇 woeginger gerhar...
  • 24 篇 fortnow l
  • 24 篇 jonsson peter
  • 22 篇 wei liu
  • 20 篇 yui-lam chan
  • 20 篇 chin-liang wang
  • 18 篇 manzoni luca
  • 18 篇 liu yang
  • 18 篇 bollig beate
  • 17 篇 lutz jack h.
  • 17 篇 dunne paul e.
  • 16 篇 bin wang
  • 16 篇 yang yang
  • 16 篇 fertin guillaume
  • 16 篇 dondi riccardo
  • 15 篇 luciano agostini
  • 15 篇 agostini luciano
  • 15 篇 jun wang
  • 15 篇 guo jiong
  • 15 篇 nie feiping

语言

  • 32,398 篇 英文
  • 907 篇 其他
  • 229 篇 中文
  • 17 篇 法文
  • 12 篇 俄文
  • 7 篇 日文
  • 6 篇 土耳其文
  • 2 篇 西班牙文
  • 2 篇 朝鲜文
  • 1 篇 德文
  • 1 篇 葡萄牙文
检索条件"主题词=computational complexity"
33578 条 记 录,以下是321-330 订阅
排序:
Utilizing computational complexity to Protect Cryptocurrency Against Quantum Threats: A Review
收藏 引用
IT PROFESSIONAL 2021年 第5期23卷 50-55页
作者: Gupta, Kishor Datta Rahman, Md. Lutfar Nag, Abhijit Kumar Mahmud, M. A. Parvez Sadman, Nafiz Univ Memphis Memphis TN 38111 USA Texas A&M Univ Cent Texas Comp Informat Syst Dept Killeen TX 76549 USA Deakin Univ Burwood Vic 3217 Australia Silicon Orchard Ltd Dhaka 1215 Bangladesh
Digital currency is primarily designed on problems that are computationally hard to solve using traditional computing techniques. However, these problems are now vulnerable due to the computational power of quantum co... 详细信息
来源: 评论
Equivalence of Convex Problem Geometry and computational complexity in the Separation Oracle Model
收藏 引用
MATHEMATICS OF OPERATIONS RESEARCH 2009年 第4期34卷 869-879页
作者: Freund, Robert M. Vera, Jorge R. MIT Alfred P Sloan Sch Management Cambridge MA 02142 USA Pontificia Univ Catolica Chile Dept Ingn Ind & Sistemas Fac Ingn Santiago 7820436 Chile
Consider the supposedly simple problem of computing a point in a convex set that is conveyed by a separation oracle with no further information (e. g., no domain ball containing or intersecting the set, etc.). The aut... 详细信息
来源: 评论
Logic and computational complexity for Boolean information retrieval
收藏 引用
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2006年 第12期18卷 1659-1666页
作者: Koubarakis, Manolis Skiadopoulos, Spiros Tryfonopoulos, Christos Univ Athens Dept Informat & Telecommun Athens 15784 Greece Univ Peloponnese Dept Comp Sci & Technol Tripoli 22100 Greece Tech Univ Crete Dept Elect & Comp Engn Khania 73100 Crete Greece
We study the complexity of query satisfiability and entailment for the Boolean Information Retrieval models WP and AWP using techniques from propositional logic and computational complexity. WP and AWP can be used to ... 详细信息
来源: 评论
ON THE computational-complexity OF PIECEWISE-LINEAR HOMOTOPY ALGORITHMS
收藏 引用
MATHEMATICAL PROGRAMMING 1982年 第2期24卷 216-224页
作者: TODD, MJ UNIV CAMBRIDGE CAMBRIDGEENGLAND
We show that piecewise-linear homotopy algorithms may take a number of steps that grows exponentially with the dimension when solving a system of linear equations whose solution lies close to the starting point. Our e... 详细信息
来源: 评论
On the computational complexity of Data Flow Analysis over finite bounded meet semilattices
收藏 引用
THEORETICAL COMPUTER SCIENCE 2021年 885卷 30-40页
作者: Sood, Gaurav Krishnan, K. Murali Inst Math Sci Chennai Chennai Tamil Nadu India Natl Inst Technol Calicut Kozhikode India
The problem of computing the meet over all paths(MOP) solution in a monotone data flow framework over an infinite meet semilattice is generally undecidable[1]. Hence, the maximum fixed point(MFP) solution, which is po... 详细信息
来源: 评论
A SUFFICIENT CONDITION OF A-PRIORI ESTIMATION FOR computational-complexity OF THE HOMOTOPY METHOD
收藏 引用
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 1993年 第5期E76A卷 786-794页
作者: MAKINO, M KASHIWAGI, M OISHI, S HORIUCHI, K Chuo Univ Tokyo Japan
A priori estimation is presented for a computational complexity of the homotopy method applying to a certain class of strongly monotone nonlinear equations. In the present papers, a condition is presented for a certai... 详细信息
来源: 评论
Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
收藏 引用
ARTIFICIAL INTELLIGENCE 2015年 226卷 34-74页
作者: Strass, Hannes Wallner, Johannes Peter Univ Leipzig Inst Comp Sci D-04109 Leipzig Germany Vienna Univ Technol Inst Informat Syst A-1040 Vienna Austria
The dialectical frameworks (ADFs) have recently been proposed as a versatile generalization of Dung's abstract argumentation frameworks (AFs). In this paper, we present a comprehensive analysis of the computationa... 详细信息
来源: 评论
The Real computational complexity of Minmax Value and Equilibrium Refinements in Multi-player Games
收藏 引用
THEORY OF COMPUTING SYSTEMS 2019年 第7期63卷 1554-1571页
作者: Hansen, Kristoffer Arnsfelt Aarhus Univ Dept Comp Sci Aarhus Denmark
We show that for several solution concepts for finite n-player games, where n >= 3, the task of simply verifying its conditions is computationally equivalent to the decision problem of the existential theory of the... 详细信息
来源: 评论
On the computational complexity of partial covers of Theta graphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2008年 第7期156卷 1143-1149页
作者: Fiala, Jiri Kratochvil, Jan Por, Attila Charles Univ Prague Fac Math & Phys Dept Appl Math Inst Theoret Comp Sci ITI Prague 11800 Czech Republic Hungarian Acad Sci Alfred Renyi Inst Math H-1053 Budapest Hungary
By use of elementary geometric arguments we prove the existence of a special integral solution of a certain system of linear equations. The existence of such a solution then yields the NP-hardness of the decision prob... 详细信息
来源: 评论
On the computational complexity of Decision Problems About Multi-player Nash Equilibria
收藏 引用
THEORY OF COMPUTING SYSTEMS 2022年 第3期66卷 519-545页
作者: Berthelsen, Marie Louisa Tolboll Hansen, Kristoffer Arnsfelt Aarhus Univ Dept Comp Sci DK-8200 Aarhus N Denmark
We study the computational complexity of decision problems about Nash equilibria in m-player games. Several such problems have recently been shown to be computationally equivalent to the decision problem for the exist... 详细信息
来源: 评论