Name
Abstract | ||
|---|---|---|
We prove that the extended equivalence problem is solvable in polynomial time for finite nilpotent groups, and coNP-complete, otherwise. We prove that the extended equation solvability problem is solvable in polynomial time for finite nilpotent groups, and NP-complete, otherwise. |
Year | Venue | Keywords |
|---|---|---|
2011 | DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE | complexity,extended equation solvability,extended equivalence,groups |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Algebra,Equivalence (measure theory),Time complexity,Mathematics,Nilpotent | Journal | 13.0 |
Issue | ISSN | Citations |
SP4.0 | 1462-7264 | 2 |
PageRank | References | Authors |
0.40 | 5 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gábor Horváth | 1 | 210 | 35.47 |
| Csaba Szabó | 2 | 21 | 4.35 |