咨询与建议

限定检索结果

文献类型

  • 1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

  • 1 篇 理学
    • 1 篇 数学

主题

  • 1 篇 tree-iterator
  • 1 篇 nosql database
  • 1 篇 recursive iterat...
  • 1 篇 terao's freeness...
  • 1 篇 rank 3 simple ma...
  • 1 篇 iterator of leav...
  • 1 篇 parallel evaluat...
  • 1 篇 integrally split...
  • 1 篇 leaf-iterator
  • 1 篇 priority queue
  • 1 篇 arangodb

机构

  • 1 篇 max planck inst ...
  • 1 篇 hebrew univ jeru...
  • 1 篇 univ kaiserslaut...
  • 1 篇 rhein westfal th...
  • 1 篇 univ st andrews ...
  • 1 篇 univ siegen dept...

作者

  • 1 篇 leuner martin
  • 1 篇 jefferson christ...
  • 1 篇 barakat mohamed
  • 1 篇 behrends reimer
  • 1 篇 kuehne lukas

语言

  • 1 篇 英文
检索条件"主题词=parallel evaluation of recursive iterator"
1 条 记 录,以下是1-10 订阅
排序:
ON THE GENERATION OF RANK 3 SIMPLE MATROIDS WITH AN APPLICATION TO TERAO'S FREENESS CONJECTURE
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2021年 第2期35卷 1201-1223页
作者: Barakat, Mohamed Behrends, Reimer Jefferson, Christopher Kuehne, Lukas Leuner, Martin Univ Siegen Dept Math D-57068 Siegen Germany Univ Kaiserslautern Dept Math D-67653 Kaiserslautern Germany Univ St Andrews Sch Comp Sci St Andrews KY16 9SX Fife Scotland Hebrew Univ Jerusalem Einstein Inst Math IL-91904 Jerusalem Israel Max Planck Inst Math Sci Leipzig Germany Rhein Westfal TH Aachen Lehrstuhl B Math Aachen Germany
In this paper we describe a parallel algorithm for generating all nonisomorphic rank 3 simple matroids with a given multiplicity vector. We apply our implementation in the high performance computing version of GAP to ... 详细信息
来源: 评论