✦ LIBER ✦

Dehn's algorithm for the word problem

✍ Scribed by Martin Greendlinger

Publisher: John Wiley and Sons
Year: 1960
Tongue: English
Weight: 778 KB
Volume: 13
Category: Article
ISSN: 0010-3640
DOI: 10.1002/cpa.3160130108

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A New Algorithm for Solving the Word Pro

A New Algorithm for Solving the Word Problem in Braid Groups

✍ D. Garber; S. Kaplan; M. Teicher 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 148 KB

One of the most interesting questions about a group is whether its word problem can be solved and how. The word problem in the braid group is of particular interest to topologists, algebraists, and geometers, and is the target of intensive current research. We look at the braid group from a topologi

The Word Problem for the Burnside Variet

The Word Problem for the Burnside Varieties

✍ O. Kharlampovich 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 310 KB

Adaptive algorithm for identification pr

Adaptive algorithm for identification problem

✍ K.G. Oza; E.I. Jury 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 393 KB

This paper considers the problem of identification of systems characterized by certain parameters. An iterative method for estimating these parameters on the basis of noise-corrupted input-output data is presented. The problem of identifying parameters of a single-input single-output discrete syste

An Efficient Algorithm for the Complex R

An Efficient Algorithm for the Complex Roots Problem

✍ C.Andrew Neff; John H. Reif 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 406 KB

Given a univariate polynomial f (z) of degree n with complex coefficients, whose norms are less than 2 m in magnitude, the root problem is to find all the roots of f (z) up to specified precision 2 ϪȐ . Assuming the arithmetic model for computation, we provide an algorithm which has complexity O(n l

Approximation algorithm for the group St

Approximation algorithm for the group Steiner network problem

✍ Michal Penn; Stas Rozenfeld 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB

## Abstract In this article we study the __group Steiner network__ problem, which is defined in the following way. Given a graph __G__ = (__V,E__), a partition of its vertices into K groups and connectivity requirements between the different groups, the aim is to find simultaneously a set of repres

An algorithm for the discrete bilevel pr

An algorithm for the discrete bilevel programming problem

✍ Jonathan F. Bard; James T. Moore 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 915 KB

The bilevel programming problem (BLPP) is an example of a two-stage, noncooperative game in which the first player can influence but not control the actions of the second. This article addresses the linear formulation and presents a new algorithm for solving the zero-one case. We begin by converting