Imagen de Portada

Computational Complexity of Finding Subgroups of a Given Order

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Lakshmanan, K.
Formato:	Preprint
Publicado:	2025
Materias:	Computational Complexity Group Theory 68Q17, 20-08
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Polynomial-time isomorphism test for groups with abelian Sylow subgroups
por: Skresanov, Saveliy V.
Publicado: (2026)

On the complexity of epimorphism testing with virtually abelian targets
por: Elder, Murray, et al.
Publicado: (2025)

The central tree property and algorithmic problems on subgroups of free groups
por: Roy, Mallika, et al.
Publicado: (2023)

On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman
por: Grochow, Joshua A., et al.
Publicado: (2021)

Parallel Algorithms for Group Isomorphism via Code Equivalence
por: Levet, Michael
Publicado: (2026)

Polynomial-time isomorphism test for $k$-generated extensions of abelian groups
por: Skresanov, Saveliy V.
Publicado: (2026)

Count-Free Weisfeiler--Leman and Group Isomorphism
por: Collins, Nathaniel A., et al.
Publicado: (2022)

Complexity of Sequence-to-Graph Alignment with Co-Linear Chaining
por: Li, Xingfu
Publicado: (2026)

How Hard is it to be a Star? Convex Geometry and the Real Hierarchy
por: Schaefer, Marcus, et al.
Publicado: (2025)

Linear average-case complexity of algorithmic problems in groups
por: Olshanskii, Alexander, et al.
Publicado: (2022)

The complexity of intersecting subproducts with subgroups in Cartesian powers
por: Spelier, Pim
Publicado: (2021)

Generalisations of Matrix Partitions : Complexity and Obstructions
por: Barsukov, Alexey, et al.
Publicado: (2021)

Reduction of the group isomorphism problem to the group automorphism problem
por: Skresanov, Saveliy V.
Publicado: (2025)

The Computational Complexity of Variational Inequalities and Applications in Game Theory
por: Kapron, Bruce M., et al.
Publicado: (2024)

Complexity and Enumeration in Models of Genome Rearrangement
por: Bailey, Lora, et al.
Publicado: (2023)

SMB algebras II: On the Constraint Satisfaction Problem over Semilattices of Mal'cev Blocks
por: Marković, Petar, et al.
Publicado: (2026)

Probabilistic Computers (So Quantum Computers) Are More Rigorously Powerful Than Traditional Computers, and Derandomization
por: Lin, Tianrong
Publicado: (2023)

Polynomial-Time Solutions for Longest Common Subsequence Related Problems Between a Sequence and a Pangenome Graph
por: Li, Xingfu, et al.
Publicado: (2026)

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness
por: Grochow, Joshua A., et al.
Publicado: (2025)

The Separation of $NP$ and $PSPACE$
por: Lin, Tianrong
Publicado: (2021)

Resolution of The Linear-Bounded Automata Question
por: Lin, Tianrong
Publicado: (2021)

Diagonalization of Polynomial-Time Deterministic Turing Machines via Nondeterministic Turing Machines
por: Lin, Tianrong
Publicado: (2021)

Identities of triangular Boolean matrices
por: Volkov, Mikhail V.
Publicado: (2024)

Dynamics and Obstructions for Self-Similar Groups Generating Free Groups
por: D'Angeli, Daniele, et al.
Publicado: (2025)

Quaternionic lattices and poly-context-free word problem
por: Bondarenko, Ievgen
Publicado: (2024)

Toward Better Depth Lower Bounds: A KRW-like theorem for Strong Composition
por: Meir, Or
Publicado: (2023)

Smaller Depth-2 Linear Circuits for Disjointness Matrices
por: Ye, Lixi
Publicado: (2026)

Polynomial Identity Testing via Evaluation of Rational Functions
por: Hu, Ivan, et al.
Publicado: (2022)

Flexible constraint satisfiability and a problem in semigroup theory
por: Jackson, Marcel
Publicado: (2015)

On the ET0L subgroup membership problem in bounded automata groups
por: Bishop, Alex, et al.
Publicado: (2024)

Simpler algorithmically unrecognizable 4-manifolds
por: Tancer, Martin
Publicado: (2023)

Toward P vs NP: An Observer-Theoretic Separation via SPDP Rank and a ZFC-Equivalent Foundation within the N-Frame Model
por: Edwards, Darren J.
Publicado: (2025)

Computing the Character Table of a 2-local Maximal Subgroup of the Monster
por: Pisani, Anthony
Publicado: (2025)

P not equal to NP
por: Delgado, Daniel Cardona
Publicado: (2023)

Unifying lower bounds for algebraic machines, semantically
por: Seiller, Thomas, et al.
Publicado: (2018)

Beyond the Existential Theory of the Reals
por: Schaefer, Marcus, et al.
Publicado: (2022)

Completeness classes in algebraic complexity theory
por: Bürgisser, Peter
Publicado: (2024)

Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard
por: Bergougnoux, Benjamin, et al.
Publicado: (2025)

Undefinability of Approximation of 2-to-2 Games
por: Dawar, Anuj, et al.
Publicado: (2025)

DAG Scheduling in the BSP Model
por: Papp, Pál András, et al.
Publicado: (2023)