| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4951995 | Theoretical Computer Science | 2017 | 9 Pages |
Abstract
In this paper we study the parameterized complexity of two well-known permutation group problems which are NP-complete.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
V. Arvind,