Skip to main navigation
Skip to search
Skip to main content
University of Illinois Urbana-Champaign Home
LOGIN & Help
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
Search by expertise, name or affiliation
The bounded and precise word problems for presentations of groups
S. V. Ivanov
Mathematics
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'The bounded and precise word problems for presentations of groups'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Word Problems
100%
Group Presentation
100%
Polynomial Time
33%
Free Group
33%
Computational Complexity
16%
Technical Results
16%
Calculus
16%
P-space
16%
Finitely Presented Groups
16%
One-relator Group
16%
Closed Curves
16%
Non-deterministic Polynomial
16%
Baumslag-Solitar
16%
Finite Presentation
16%
Space Bound
16%
Defining Relations
16%
Polynomial Space
16%
Word Problem for Groups
16%
Free Product of Cyclic Groups
16%
Mathematics
Polynomial Time
100%
Free Group
100%
Polynomial
50%
Calculus
50%
Cyclic Group
50%
Finitely presented group
50%
Closed Curve
50%
Defining Relation
50%