Non-commutative cryptography and complexity of group-theoretic problems / Myasnikov, Alexei G.
This book is about relations between three different areas of mathematics and theoretical computer science: combinatorial group theory, cryptography, and complexity theory. It explores how non-commutative (infinite) groups, which are typically studied in combinatorial group theory, can be used in pu...
Saved in:
Online Access: |
Full Text (via EBSCO) |
---|---|
Main Author: | |
Other Authors: | , |
Format: | eBook |
Language: | English |
Published: |
[Place of publication not identified] :
American Mathematical Society,
2011.
|
Series: | Mathematical surveys and monographs ;
no. 177. |
Subjects: |
Internet
Full Text (via EBSCO)Online
Call Number: |
QA182.5
|
---|---|
QA182.5 | Available |