株式会社極東書店トップ ＞ 商品一覧 ＞ The Bounded and Precise Word Problems for Presentations of Groups.
商品詳細
The Bounded and Precise Word Problems for Presentations of Groups.
・ISBN 978-1-4704-4143-2 paper US$ 85.00
￥19,915.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
お気に入り
★★★
| 著者・編者 | Ivanov, S.V., |
|---|---|
| シリーズ | Memoirs of the American Mathematical Society |
| 出版社 | (American Mathematical Society, US) |
| 出版年月 | 2020 |
| ページ数 | 106 pp. |
| 言語 | ENG |
| ニュース番号 | ＜M25-13277＞ |
解説
The author introduces and studies the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group, the bounded word problem is in NP, i.e., it can be solved in nondeterministic polynomial time, and the precise word problem is in PSPACE, i.e., it can be solved in polynomial space. The main technical result of the paper states that, for certain finite presentations of groups, which include the Baumslag-Solitar one-relator groups and free products of cyclic groups, the bounded word problem and the precise word problem can be solved in polylogarithmic space.
As consequences of developed techniques that can be described as calculus of brackets, the author obtains polylogarithmic space bounds for the computational complexity of the diagram problem for free groups, for the width problem for elements of free groups, and for computation of the area defined by polygonal singular closed curves in the plane. The author also obtains polynomial time bounds for these problems.
As consequences of developed techniques that can be described as calculus of brackets, the author obtains polylogarithmic space bounds for the computational complexity of the diagram problem for free groups, for the width problem for elements of free groups, and for computation of the area defined by polygonal singular closed curves in the plane. The author also obtains polynomial time bounds for these problems.