Copertina

On the Constant-Depth Circuit Complexity of Generating Quasigroups

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Collins, Nathaniel A., Grochow, Joshua A., Levet, Michael, Weiß, Armin
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Computational Complexity Data Structures and Algorithms Combinatorics Group Theory
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

On the Parallel Complexity of Identifying Groups and Quasigroups via Decompositions
di: Johnson, Dan, et al.
Pubblicazione: (2025)

Complexity of Constructing Minimal Faithful Permutation Representations for Fitting-free Groups
di: Levet, Michael, et al.
Pubblicazione: (2025)

Reconstructing Sets of Strings from Their k-way Projections: Algorithms & Complexity
di: Tate, Elise, et al.
Pubblicazione: (2025)

Explicit Lossless Vertex Expanders
di: Hsieh, Jun-Ting, et al.
Pubblicazione: (2025)

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

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

Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits
di: Kumar, Mrinal, et al.
Pubblicazione: (2024)

Finite matrix multiplication algorithms from infinite groups
di: Blasiak, Jonah, et al.
Pubblicazione: (2024)

Constant congestion linkages in polynomially strong digraphs in polynomial time
di: Lopes, Raul, et al.
Pubblicazione: (2024)

Parallel Algorithms for Group Isomorphism via Code Equivalence
di: Levet, Michael
Pubblicazione: (2026)

Computational Complexity of Swish
di: Horiyama, Takashi, et al.
Pubblicazione: (2026)

Kernelization Complexity of Solution Discovery Problems
di: Grobler, Mario, et al.
Pubblicazione: (2024)

Complexity of Paired Domination Problems on Circle and $k$-Polygon Graphs
di: Mu, Ta-Yu, et al.
Pubblicazione: (2024)

NP-Completeness of Deterministic Communication Complexity via Relaxed Interlacing
di: Gaspers, Serge, et al.
Pubblicazione: (2025)

Constant Rate Isometric Embeddings of Hamming Metric into Edit Metric
di: Bhattacharya, Sudatta, et al.
Pubblicazione: (2025)

Optimal Trickle-Down Theorems for Path Complexes via C-Lorentzian Polynomials with Applications to Sampling and Log-Concave Sequences
di: Leake, Jonathan, et al.
Pubblicazione: (2025)

Testability in group theory
di: Becker, Oren, et al.
Pubblicazione: (2022)

Testability of relations between permutations
di: Becker, Oren, et al.
Pubblicazione: (2020)

A General Framework for Low Soundness Homomorphism Testing
di: Mittal, Tushant, et al.
Pubblicazione: (2025)

Explicit Good Codes Approaching Distance 1 in Ulam Metric
di: Goldenberg, Elazar, et al.
Pubblicazione: (2024)

Explicit Orthogonal Arrays and Universal Hashing with Arbitrary Parameters
di: Harvey, Nicholas, et al.
Pubblicazione: (2024)

Hypergraph Samplers: Typical and Worst Case Behavior
di: Alev, Vedat Levi, et al.
Pubblicazione: (2026)

Smoothed analysis for graph isomorphism
di: Anastos, Michael, et al.
Pubblicazione: (2024)

Testing Sumsets is Hard
di: Chen, Xi, et al.
Pubblicazione: (2024)

Inference of rankings planted in random tournaments
di: Kunisky, Dmitriy, et al.
Pubblicazione: (2024)

Statistical inference of a ranked community in a directed graph
di: Kunisky, Dmitriy, et al.
Pubblicazione: (2024)

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

The Simultaneous Triple Product Property and Group-theoretic Results for the Exponent of Matrix Multiplication
di: Murthy, Sandeep
Pubblicazione: (2007)

Parameterized Complexity of (d,r)-Domination via Modular Decomposition
di: Cordasco, Gennaro, et al.
Pubblicazione: (2024)

Parameterized Shortest Path Reconfiguration
di: Bousquet, Nicolas, et al.
Pubblicazione: (2024)

Forest Covers and Bounded Forest Covers
di: Gaur, Daya Ram, et al.
Pubblicazione: (2024)

On $[1,2]$-Domination in Interval and Circle Graphs
di: Meybodi, Mohsen Alambardar, et al.
Pubblicazione: (2024)

Fourier Analysis of Iterative Algorithms
di: Jones, Chris, et al.
Pubblicazione: (2024)

Computing the $D$-base and $D$-relation in finite closure systems
di: Adaricheva, Kira, et al.
Pubblicazione: (2024)

Characterizing and Testing Principal Minor Equivalence of Matrices
di: Chatterjee, Abhranil, et al.
Pubblicazione: (2024)

Asymptotically Optimal Hardness for $k$-Set Packing and $k$-Matroid Intersection
di: Lee, Euiwoong, et al.
Pubblicazione: (2024)

Trickle-down Theorems via C-Lorentzian Polynomials II: Pairwise Spectral Influence and Improved Dobrushin's Condition
di: Leake, Jonathan, et al.
Pubblicazione: (2025)

Faster Algorithms for Sparse ILP and Hypergraph Multi-Packing/Multi-Cover Problems
di: Gribanov, Dmitry, et al.
Pubblicazione: (2022)

Equivalent Dichotomies for Triangle Detection in Subgraph, Induced, and Colored H-Free Graphs
di: Abboud, Amir, et al.
Pubblicazione: (2026)

Vector TSP: A Traveling Salesperson Problem with Racetrack-like Acceleration Constraints
di: Casteigts, Arnaud, et al.
Pubblicazione: (2020)