Imagen de Portada

On Degeneracy in the P-Matroid Oriented Matroid Complementarity Problem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Borzechowski, Michaela, Weber, Simon
Formato:	Preprint
Publicado:	2023
Materias:	Combinatorics Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Representing Matroids over the Reals is $\exists \mathbb R$-complete
por: Kim, Eun Jung, et al.
Publicado: (2023)

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

Arithmetic Circuits and Neural Networks for Regular Matroids
por: Hertrich, Christoph, et al.
Publicado: (2025)

Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents
por: Borzechowski, Michaela, et al.
Publicado: (2024)

Parameterised Holant Problems
por: Aivasiliotis, Panagiotis, et al.
Publicado: (2024)

Hardness of Hypergraph Edge Modification Problems
por: Gishboliner, Lior, et al.
Publicado: (2025)

The Rank-Ramsey Problem and the Log-Rank Conjecture
por: Beniamini, Gal, et al.
Publicado: (2024)

The Complexity Classes of Hamming Distance Recoverable Robust Problems
por: Grüne, Christoph
Publicado: (2022)

King Chasing Problem in Chinese Chess is NP-hard
por: Li, Chao, et al.
Publicado: (2026)

Extension-lifting Bijections for Oriented Matroids
por: Backman, Spencer, et al.
Publicado: (2019)

The Fine-Grained Complexity of Graph Homomorphism Problems: Towards the Okrasa and Rzążewski Conjecture
por: Baril, Ambroise, et al.
Publicado: (2024)

Splitting Sandwiches Unevenly via Unique Sink Orientations and Rainbow Arrangements
por: Borzechowski, Michaela, et al.
Publicado: (2026)

Optimal Parallel Basis Finding in Graphic and Related Matroids
por: Khanna, Sanjeev, et al.
Publicado: (2025)

Linkage Axioms for Generic Tropical Oriented Matroids
por: Yao, Yuan
Publicado: (2025)

Linear Matroid Intersection is in Catalytic Logspace
por: Agarwala, Aryan, et al.
Publicado: (2025)

Fractional Linear Matroid Matching is in quasi-NC
por: Gurjar, Rohit, et al.
Publicado: (2024)

Matroids are Equitable
por: Akrami, Hannaneh, et al.
Publicado: (2025)

The Parametric Matroid $\ell$-Interdiction Problem
por: Hausbrandt, Nils, et al.
Publicado: (2024)

Principal Matroid Determinants
por: Matsubara-Heo, Saiei-Jaeyeong, et al.
Publicado: (2026)

On Computational Aspects of Ordered Matching Problems
por: Čertík, Michal, et al.
Publicado: (2025)

The Subgraph Isomorphism Problem for Port Graphs and Quantum Circuits
por: Mondada, Luca, et al.
Publicado: (2023)

Matroid bingo
por: Baker, Matthew, et al.
Publicado: (2025)

Learning Read-Once Determinants and the Principal Minor Assignment Problem
por: Aravind, Abhiram, et al.
Publicado: (2026)

Symmetric Tensor Matroids, Dual Rigidity Matroids, and the Maximality Conjecture
por: Jackson, Bill, et al.
Publicado: (2025)

A SAT Solver and Computer Algebra Attack on the Minimum Kochen-Specker Problem
por: Li, Zhengyu, et al.
Publicado: (2023)

An Approximation Framework for Parametric Matroid Interdiction Problems
por: Hausbrandt, Nils, et al.
Publicado: (2025)

Local Homophily on Bicolored Graphs is $\mathbf{P}$-complete
por: Concha-Vega, Pablo
Publicado: (2026)

An $\widetilde{O} (n^{3/7})$ Round Parallel Algorithm for Matroid Bases
por: Khanna, Sanjeev, et al.
Publicado: (2026)

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

Flat origami is Turing Complete
por: Hull, Thomas C., et al.
Publicado: (2023)

Systems of Discrete Differential Equations, Constructive Algebraicity of the Solutions
por: Notarantonio, Hadrien, et al.
Publicado: (2023)

Agreement theorems for high dimensional expanders in the small soundness regime: the role of covers
por: Dikstein, Yotam, et al.
Publicado: (2023)

Query complexity of Boolean functions on the middle slice of the cube
por: Gerbner, Dániel, et al.
Publicado: (2023)

On Approximability of Satisfiable k-CSPs: IV
por: Bhangale, Amey, et al.
Publicado: (2023)

Explicit Directional Affine Extractors and Improved Hardness for Linear Branching Programs
por: Li, Xin, et al.
Publicado: (2023)

On a Hierarchy of Spectral Invariants for Graphs
por: Arvind, V., et al.
Publicado: (2023)

A parameterized algorithm for $K_r$-factors in graphs of high minimum degree
por: Gan, Luyining, et al.
Publicado: (2023)

Low-Degree Polynomials Are Good Extractors
por: Alrabiah, Omar, et al.
Publicado: (2024)

Complexity Framework For Forbidden Subgraphs V: Beyond Simple Graphs
por: Eagling-Vose, Tala, et al.
Publicado: (2025)

Refuting Perfect Matchings in Spectral Expanders is Hard
por: Biswas, Ari, et al.
Publicado: (2025)