Image de couverture de livre

Characterizing and Testing Principal Minor Equivalence of Matrices

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chatterjee, Abhranil, Ghosh, Sumanta, Gurjar, Rohit, Raj, Roshan
Format:	Preprint
Publié:	2024
Sujets:	Computational Complexity Data Structures and Algorithms Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Learning Read-Once Determinants and the Principal Minor Assignment Problem
par: Aravind, Abhiram, et autres
Publié: (2026)

Fractional Linear Matroid Matching is in quasi-NC
par: Gurjar, Rohit, et autres
Publié: (2024)

Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time
par: Arvind, V., et autres
Publié: (2023)

On Detecting $H$-Induced Minors for Small $H$
par: Eagling-Vose, Tala, et autres
Publié: (2026)

Equivalent Dichotomies for Triangle Detection in Subgraph, Induced, and Colored H-Free Graphs
par: Abboud, Amir, et autres
Publié: (2026)

Testing Sumsets is Hard
par: Chen, Xi, et autres
Publié: (2024)

A General Framework for Low Soundness Homomorphism Testing
par: Mittal, Tushant, et autres
Publié: (2025)

Induced Minor Models. II. Sufficient conditions for polynomial-time detection of induced minors
par: Dallard, Clément, et autres
Publié: (2024)

Parameterized Shortest Path Reconfiguration
par: Bousquet, Nicolas, et autres
Publié: (2024)

Forest Covers and Bounded Forest Covers
par: Gaur, Daya Ram, et autres
Publié: (2024)

Constant congestion linkages in polynomially strong digraphs in polynomial time
par: Lopes, Raul, et autres
Publié: (2024)

Complexity of Paired Domination Problems on Circle and $k$-Polygon Graphs
par: Mu, Ta-Yu, et autres
Publié: (2024)

On $[1,2]$-Domination in Interval and Circle Graphs
par: Meybodi, Mohsen Alambardar, et autres
Publié: (2024)

Fourier Analysis of Iterative Algorithms
par: Jones, Chris, et autres
Publié: (2024)

Kernelization Complexity of Solution Discovery Problems
par: Grobler, Mario, et autres
Publié: (2024)

Computing the $D$-base and $D$-relation in finite closure systems
par: Adaricheva, Kira, et autres
Publié: (2024)

Smoothed analysis for graph isomorphism
par: Anastos, Michael, et autres
Publié: (2024)

Asymptotically Optimal Hardness for $k$-Set Packing and $k$-Matroid Intersection
par: Lee, Euiwoong, et autres
Publié: (2024)

Computational Complexity of Swish
par: Horiyama, Takashi, et autres
Publié: (2026)

Trickle-down Theorems via C-Lorentzian Polynomials II: Pairwise Spectral Influence and Improved Dobrushin's Condition
par: Leake, Jonathan, et autres
Publié: (2025)

Faster Algorithms for Sparse ILP and Hypergraph Multi-Packing/Multi-Cover Problems
par: Gribanov, Dmitry, et autres
Publié: (2022)

Hypergraph Samplers: Typical and Worst Case Behavior
par: Alev, Vedat Levi, et autres
Publié: (2026)

Optimal Trickle-Down Theorems for Path Complexes via C-Lorentzian Polynomials with Applications to Sampling and Log-Concave Sequences
par: Leake, Jonathan, et autres
Publié: (2025)

Vector TSP: A Traveling Salesperson Problem with Racetrack-like Acceleration Constraints
par: Casteigts, Arnaud, et autres
Publié: (2020)

On the complexity of global Roman domination problem in graphs
par: Reddy, Sangam Balchandar, et autres
Publié: (2026)

A Refined Laser Method and Faster Matrix Multiplication
par: Alman, Josh, et autres
Publié: (2020)

A Fast Coloring Oracle for Average Case Hypergraphs
par: Marcussen, Cassandra, et autres
Publié: (2025)

Deciding if a DAG is Interesting is Hard
par: De Carufel, Jean-Lou, et autres
Publié: (2025)

NP-Completeness of Deterministic Communication Complexity via Relaxed Interlacing
par: Gaspers, Serge, et autres
Publié: (2025)

Computational hardness of detecting graph lifts and certifying lift-monotone properties of random regular graphs
par: Kunisky, Dmitriy, et autres
Publié: (2024)

Some easy optimization problems have the overlap-gap property
par: Li, Shuangping, et autres
Publié: (2024)

Polynomial-time sampling despite disorder chaos
par: Ma, Eric, et autres
Publié: (2025)

Equivalent Instances for Scheduling and Packing Problems
par: Jansen, Klaus, et autres
Publié: (2025)

Self-referential instances of the dominating set problem are irreducible
par: Zhou, Guangyan
Publié: (2026)

Feature Selection and Junta Testing are Statistically Equivalent
par: Beretta, Lorenzo, et autres
Publié: (2025)

Algorithms and complexity for monitoring edge-geodetic sets in graphs
par: Foucaud, Florent, et autres
Publié: (2024)

On the Constant-Depth Circuit Complexity of Generating Quasigroups
par: Collins, Nathaniel A., et autres
Publié: (2024)

Graph Search Trees and the Intermezzo Problem
par: Beisegel, Jesse, et autres
Publié: (2024)

Explicit Two-Sided Vertex Expanders Beyond the Spectral Barrier
par: Hsieh, Jun-Ting, et autres
Publié: (2024)

Enumeration of minimal transversals of hypergraphs of bounded VC-dimension
par: Mary, Arnaud
Publié: (2024)