咨询与建议

限定检索结果

文献类型

  • 44 篇 期刊文献
  • 14 篇 会议

馆藏范围

  • 58 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 49 篇 工学
    • 48 篇 计算机科学与技术...
    • 6 篇 电气工程
    • 5 篇 软件工程
    • 2 篇 控制科学与工程
    • 1 篇 电子科学与技术(可...
  • 34 篇 理学
    • 33 篇 数学
    • 1 篇 物理学
    • 1 篇 统计学(可授理学、...
  • 4 篇 管理学
    • 4 篇 管理科学与工程(可...
    • 1 篇 工商管理
  • 1 篇 经济学
    • 1 篇 应用经济学

主题

  • 58 篇 parallel complex...
  • 6 篇 parallel algorit...
  • 5 篇 logp model
  • 5 篇 linear algebra
  • 4 篇 computational co...
  • 3 篇 nc
  • 3 篇 algorithms
  • 3 篇 algebraic comple...
  • 3 篇 matrix multiplic...
  • 2 篇 baumslag group
  • 2 篇 quasi-nc
  • 2 篇 macro-data flow ...
  • 2 篇 submodular funct...
  • 2 篇 numerical algori...
  • 2 篇 signed graphs
  • 2 篇 nc algorithms
  • 2 篇 parallel models
  • 2 篇 abelian group
  • 2 篇 arithmetic netwo...
  • 2 篇 direct methods

机构

  • 4 篇 virginia polytec...
  • 2 篇 abo akad univ de...
  • 2 篇 lipn cnrs umr 70...
  • 2 篇 moldavian acad s...
  • 2 篇 inst math sci ma...
  • 2 篇 turku ctr comp s...
  • 2 篇 univ cantabria f...
  • 1 篇 aalen univ fak e...
  • 1 篇 univ pisa dipart...
  • 1 篇 lri bat. 490 uni...
  • 1 篇 univ stuttgart i...
  • 1 篇 univ toronto dep...
  • 1 篇 chennai
  • 1 篇 chennai math ins...
  • 1 篇 univ south carol...
  • 1 篇 univ bologna dip...
  • 1 篇 armstrong atlant...
  • 1 篇 hermann hesse we...
  • 1 篇 vishwakarma inst...
  • 1 篇 ibm corp thomas ...

作者

  • 4 篇 santos ee
  • 3 篇 gurjar rohit
  • 3 篇 thierauf thomas
  • 2 篇 jiang haotian
  • 2 篇 montana jl
  • 2 篇 graur andrei
  • 2 篇 sidford aaron
  • 2 篇 petre ion
  • 2 篇 mattes caroline
  • 2 篇 alhazov artiom
  • 2 篇 fenner stephen
  • 2 篇 sedjelmaci sidi ...
  • 2 篇 weiss armin
  • 2 篇 arvind v.
  • 2 篇 pardo lm
  • 1 篇 litow b
  • 1 篇 trystram d
  • 1 篇 immerman n
  • 1 篇 yaku t
  • 1 篇 roch jl

语言

  • 53 篇 英文
  • 5 篇 其他
检索条件"主题词=parallel complexity"
58 条 记 录,以下是41-50 订阅
排序:
Improved parallel Algorithms for Generalized Baumslag Groups  15th
Improved Parallel Algorithms for Generalized Baumslag Groups
收藏 引用
15th Latin American Symposium on Theoretical Informatics
作者: Mattes, Caroline Weiss, Armin Univ Stuttgart Inst Formale Methoden Informat Stuttgart Germany
The Baumslag group had been a candidate for a group with an extremely difficult word problem until Myasnikov, Ushakov, and Won succeeded to show that its word problem can be solved in polynomial time. Their result use... 详细信息
来源: 评论
Bipartite Perfect Matching Is in Quasi-NC  16
Bipartite Perfect Matching Is in Quasi-NC
收藏 引用
48th Annual ACM SIGACT Symposium on Theory of Computing (STOC)
作者: Fenner, Stephen Gurjar, Rohit Thierauf, Thomas Univ South Carolina Columbia SC 29208 USA Aalen Univ Aalen Germany
We show that the bipartite perfect matching problem is in quasi-NC2. That is, it has uniform circuits of quasi polynomial size n(O(log n)) and O(log(2) n) depth. Previously, only an exponential upper bound was known o... 详细信息
来源: 评论
Tight Bounds for Monotone Switching Networks via Fourier Analysis  12
Tight Bounds for Monotone Switching Networks via Fourier Ana...
收藏 引用
44th ACM Annual Symposium on Theory of Computing (STOC)
作者: Chan, Siu Man Potechin, Aaron Univ Calif Berkeley Berkeley CA 94720 USA MIT Cambridge MA USA
We prove tight size bounds on monotone switching networks for the k-clique problem, and for an explicit monotone problem by analyzing the generation problem with a pyramid structure of height h. This gives alternative... 详细信息
来源: 评论
ALOGTIME and a conjecture of S.A. Cook
收藏 引用
Annals of Mathematics and Artificial Intelligence 1992年 第1-3期6卷 57-106页
作者: Clote, Peter Department of Computer Science Boston College Chestnut Hill 02167 MA United States
Using sequential, machine-independent characterization of the parallel complexity classes ACk and NCk, we establish the following conjecture of S.A. Cook. There is a free variable equational logic ALV with the propert... 详细信息
来源: 评论
Improved Lower Bounds for Submodular Function Minimization  63
Improved Lower Bounds for Submodular Function Minimization
收藏 引用
63rd Annual IEEE Symposium on Foundations of Computer Science (FOCS)
作者: Chakrabarty, Deeparnab Graur, Andrei Jiang, Haotian Sidford, Aaron Dartmouth Coll Dept Comp Sci Hanover NH 03755 USA Stanford Univ Dept Management Sci & Engn Stanford CA 94305 USA Univ Washington Paul G Allen Sch Comp Sci & Engn Seattle WA 98195 USA Stanford Univ Dept Comp Sci Stanford CA 94305 USA
We provide a generic technique for constructing families of submodular functions to obtain lower bounds for submodular function minimization (SFM). Applying this technique, we prove that any deterministic SFM algorith... 详细信息
来源: 评论
parallel algorithms for m-out-of-n threshold voting
Parallel algorithms for m-out-of-n threshold voting
收藏 引用
1996 IEEE 2nd International Conference on Algorithms and Architectures for parallel Processing (ICA3PP 96)
作者: Parhami, B Univ of California Santa Barbara United States
Voting on large collections of input objects is becoming increasingly important in data fusion, signal and image processing, and distributed computing. To achieve high speed in voting, the multiple processing resource... 详细信息
来源: 评论
Submodular Maximization with Matroid and Packing Constraints in parallel  2019
Submodular Maximization with Matroid and Packing Constraints...
收藏 引用
51st Annual ACM SIGACT Symposium on Theory of Computing (STOC)
作者: Ene, Alina Nguyen, Huy L. Vladu, Adrian Boston Univ Dept Comp Sci 111 Cummington St Boston MA 02215 USA Northeastern Univ Coll Comp & Informat Sci Boston MA 02115 USA
We consider the problem of maximizing the multilinear extension of a submodular function subject a single matroid constraint or multiple packing constraints with a small number of adaptive rounds of evaluation queries... 详细信息
来源: 评论
The characterization of parallel real-time optimization problems  16
The characterization of parallel real-time optimization prob...
收藏 引用
16th Annual International Symposium on High Performance Computing Systems and Applications
作者: Bruda, SD Akl, SG Queens Univ Dept Comp & Informat Sci Kingston ON K7L 3N6 Canada
We identify the class of optimization problem expressible as independence systems that can be solved in real time using a parallel machine with polynomially bounded resources as being exactly the class of matroid for ... 详细信息
来源: 评论
Efficient and optimal parallel algorithms for cholesky decomposition
收藏 引用
Journal of Mathematical Modelling and Algorithms 2003年 第3期2卷 217-234页
作者: Santos, Eunice E. Chu, Pei-Yue Department of Computer Science Virginia Polytechnic Institute and State University Blacksburg VA 24061 United States Department of Computer Science and Engineering Lehigh University Bethlehem PA 18015 United States
In this paper, we consider the problem of developing efficient and optimal parallel algorithms for Cholesky decomposition. We design our algorithms based on different data layouts and methods. We thereotically analyze... 详细信息
来源: 评论
Sparse Submodular Function Minimization  64
Sparse Submodular Function Minimization
收藏 引用
64th Annual IEEE Symposium on the Foundations of Computer Science (FOCS)
作者: Graur, Andrei Jiang, Haotian Sidford, Aaron Stanford Univ Management Sci & Engn Stanford CA 94305 USA Microsoft Res Redmond WA USA
In this paper we study the problem of minimizing a submodular function f : 2(V) -> R that is guaranteed to have a k-sparse minimizer. We give a deterministic algorithm that computes an additive epsilon-approximate ... 详细信息
来源: 评论