✦ LIBER ✦

Average-case complexity and decision problems in group theory

✍ Scribed by Ilya Kapovich; Alexei Myasnikov; Paul Schupp; Vladimir Shpilrain

Book ID: 108051363
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 276 KB
Volume: 190
Category: Article
ISSN: 0001-8708
DOI: 10.1016/j.aim.2003.02.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generic-case complexity, decision proble

Generic-case complexity, decision problems in group theory, and random walks

✍ Ilya Kapovich; Alexei Myasnikov; Paul Schupp; Vladimir Shpilrain 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 258 KB

We give a precise definition of "generic-case complexity" and show that for a very large class of finitely generated groups the classical decision problems of group theory-the word, conjugacy, and membership problems-all have linear-time generic-case complexity. We prove such theorems by using the t

Decision Problems in Group Theory

✍ Kalorkoti, K. A. 📂 Article 📅 1982 🏛 Oxford University Press 🌐 English ⚖ 458 KB

Complexity of multilinear problems in th

Complexity of multilinear problems in the average case setting

✍ Tomasz Jackowski 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 960 KB

Average-case complexity of shortest-path

Average-case complexity of shortest-paths problems in the vertex-potential model

✍ Colin Cooper; Alan Frieze; Kurt Mehlhorn; Volker Priebe 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 146 KB 👁 2 views

We study the average-case complexity of shortest-paths problems in the vertexpotential model. The vertex-potential model is a family of probability distributions on complete directed graphs with arbitrary real edge lengths, but without negative cycles. We show that on a graph with n vertices and wit

Cyclic sequencing problems in the two-ma

Cyclic sequencing problems in the two-machine permutation flow shop: Complexity, worst-case, and average-case analysis

✍ Hirofumi Matsuo 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 756 KB

Average-Case Complexity (Foundations and

Average-Case Complexity (Foundations and Trends(R) in Theoretical Computer Science)

✍ Andrej Bogdanov, Luca Trevisan 📂 Library 📅 2006 🏛 Now Publishers Inc 🌐 English ⚖ 584 KB

Average-Case Complexity is a thorough survey of the average-case complexity of problems in NP. The study of the average-case complexity of intractable problems began in the 1970s, motivated by two distinct applications: the developments of the foundations of cryptography and the search for methods t