咨询与建议

限定检索结果

文献类型

  • 13 篇 期刊文献
  • 4 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 14 篇 理学
    • 13 篇 数学
    • 1 篇 化学
  • 12 篇 工学
    • 12 篇 计算机科学与技术...
    • 1 篇 化学工程与技术
    • 1 篇 软件工程

主题

  • 17 篇 algorithmic grou...
  • 6 篇 word problem
  • 4 篇 conjugacy proble...
  • 3 篇 power circuit
  • 3 篇 compression
  • 3 篇 data structures
  • 2 篇 baumslag group
  • 2 篇 hyperbolic group...
  • 2 篇 generic case com...
  • 1 篇 frattini subgrou...
  • 1 篇 constitutional i...
  • 1 篇 computational co...
  • 1 篇 soluble groups
  • 1 篇 maximal subgroup...
  • 1 篇 stallings pregro...
  • 1 篇 algorithms for g...
  • 1 篇 open-source soft...
  • 1 篇 logspace complex...
  • 1 篇 hnn-extensions
  • 1 篇 membership probl...

机构

  • 4 篇 univ stuttgart f...
  • 3 篇 stevens inst tec...
  • 3 篇 univ siegen sieg...
  • 2 篇 univ stuttgart i...
  • 1 篇 stevens inst tec...
  • 1 篇 univ stuttgart i...
  • 1 篇 max planck inst ...
  • 1 篇 tech univ carolo...
  • 1 篇 univ warwick dep...
  • 1 篇 univ london quee...
  • 1 篇 univ siegen dept...
  • 1 篇 martin luther un...
  • 1 篇 friedrich schill...
  • 1 篇 univ stuttgart u...
  • 1 篇 univ warwick mat...
  • 1 篇 newcastle univ n...
  • 1 篇 univ sydney sch ...
  • 1 篇 iav gmbh gifhorn...
  • 1 篇 tu braunschweig ...
  • 1 篇 univ st andrews ...

作者

  • 6 篇 diekert volker
  • 4 篇 lohrey markus
  • 3 篇 laun juern
  • 3 篇 weiss armin
  • 3 篇 myasnikov alexei...
  • 2 篇 ushakov alexande...
  • 1 篇 eick b
  • 1 篇 schleimer saul
  • 1 篇 eick bettina
  • 1 篇 jefferson christ...
  • 1 篇 waldecker rebecc...
  • 1 篇 sorokina maria
  • 1 篇 steinbeck christ...
  • 1 篇 yirik mehmet azi...
  • 1 篇 kausch jonathan
  • 1 篇 beynon wm
  • 1 篇 mattes caroline
  • 1 篇 figelius michael
  • 1 篇 cannon jj
  • 1 篇 holt derek

语言

  • 15 篇 英文
  • 1 篇 其他
检索条件"主题词=algorithmic group theory"
17 条 记 录,以下是11-20 订阅
排序:
Efficient Algorithms for Highly Compressed Data: The Word Problem in Generalized Higman groups Is in P
收藏 引用
theory OF COMPUTING SYSTEMS 2014年 第4期55卷 742-770页
作者: Laun, Juern Univ Stuttgart Inst Formale Methoden Informat D-70199 Stuttgart Germany
This paper continues the 2012 STACS contribution by Diekert, Ushakov, and the author as well as the 2012 IJAC publication by the same authors. We extend the results published there in two ways. First, we show that the... 详细信息
来源: 评论
Conjugacy in Baumslag's group, Generic Case Complexity, and Division in Power Circuits
Conjugacy in Baumslag's Group, Generic Case Complexity, and ...
收藏 引用
11th Latin American Theoretical INformatics Symposium (LATIN)
作者: Diekert, Volker Myasnikov, Alexei G. Weiss, Armin Univ Stuttgart FMI Univ Str 38 D-70569 Stuttgart Germany Stevens Inst Technol Dept Math Hoboken NJ USA
The conjugacy problem is the following question: given two words x, y over generators of a fixed group G, decide whether x and y are conjugated, i.e., whether there exists some z such that zxz(-1) = y in G. The conjug... 详细信息
来源: 评论
Cyclic rewriting and conjugacy problems
收藏 引用
groupS COMPLEXITY CRYPTOLOGY 2012年 第2期4卷 321-355页
作者: Diekert, Volker Duncan, Andrew Myasnikov, Alexei G. Univ Stuttgart Univ Str 38 D-70569 Stuttgart Germany Newcastle Univ Newcastle Upon Tyne NE1 7RU Tyne & Wear England Stevens Inst Technol Hoboken NJ 07030 USA
Cyclic words are equivalence classes of cyclic permutations of ordinary words. When a group is given by a rewriting relation, a rewriting system on cyclic words is induced, which is used to construct algorithms to fin... 详细信息
来源: 评论
Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P
Efficient algorithms for highly compressed data: The Word Pr...
收藏 引用
29th International Symposium on Theoretical Aspects of Computer Science (STACS)
作者: Diekert, Volker Laun, Juern Ushakov, Alexander Univ Stuttgart FMI Univ Str 38 D-70569 Stuttgart Germany Stevens Inst Technol Dept Math Hoboken NJ 07030 USA
Power circuits are data structures which support efficient algorithms for highly compressed integers. Using this new data structure it has been shown recently by Myasnikov, Ushakov and Won that the Word Problem of the... 详细信息
来源: 评论
EFFICIENT ALGORITHMS FOR HIGHLY COMPRESSED DATA: THE WORD PROBLEM IN HIGMAN'S group IS IN P
收藏 引用
INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION 2012年 第8期22卷 1240008-1240008页
作者: Diekert, Volker Laun, Juern Ushakov, Alexander Univ Stuttgart Inst Formale Methoden Informat D-70199 Stuttgart Germany Stevens Inst Technol Dept Math Hoboken NJ 07030 USA
Power circuits are data structures which support efficient algorithms for highly compressed integers. Using this new data structure it has been shown recently by Myasnikov, Ushakov and Won that the Word Problem of the... 详细信息
来源: 评论
Special polycyclic generating sequences for finite soluble groups
收藏 引用
JOURNAL OF SYMBOLIC COMPUTATION 2004年 第5期38卷 1445-1460页
作者: Cannon, JJ Eick, B Leedham-Green, CR Tech Univ Carolo Wilhelmina Braunschweig Inst Computat Math D-38106 Braunschweig Germany Univ Sydney Sch Math & Stat Sydney NSW 2006 Australia Univ London Queen Mary & Westfield Coll Sch Math Sci London E1 4NS England
Polycyclic generating sequences are known to be a powerful tool in the design of practical and efficient algorithms for computing in finite soluble groups. Here we describe a further development: the so-called special... 详细信息
来源: 评论
COMPUTING A BASIS FOR A FINITE ABELIAN P-group
收藏 引用
INFORMATION PROCESSING LETTERS 1985年 第3期20卷 161-163页
作者: BEYNON, WM ILIOPOULOS, CS UNIV WARWICK DEPT COMP SCICOVENTRY CV4 7ALW MIDLANDSENGLAND
An algorithm for calculating a basis for a finite abelian p-group, given a set of generators, is described. The alternative method presented does not assume that defining relations of the p-group are known, but emplo... 详细信息
来源: 评论