Image de couverture de livre

Determining Implication of Fixed Matrix Prenex Normal Forms Can Be Decided in Linear Time

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Wang, Adam
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Detecting Disjoint Shortest Paths in Linear Time and More
par: Akmal, Shyan, et autres
Publié: (2024)

A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs
par: Paul-Pena, Daniel, et autres
Publié: (2022)

(Approximate) Matrix Multiplication via Convolutions
par: Uffenheimer, Yahel, et autres
Publié: (2025)

Approximating Maximum Edge 2-Coloring by Normalizing Graphs
par: Mömke, Tobias, et autres
Publié: (2024)

On the Parameterized Intractability of Determinant Maximization
par: Ohsaka, Naoto
Publié: (2022)

On the Relationship Between Several Variants of the Linear Hashing Conjecture
par: Westover, Alek
Publié: (2023)

A Structural Linear-Time Algorithm for Computing the Tutte Decomposition
par: Bourneuf, Romain, et autres
Publié: (2025)

Double-Ended Palindromic Trees in Linear Time
par: Wang, Qisheng, et autres
Publié: (2022)

Hypergraph Connectivity Augmentation in Strongly Polynomial Time
par: Bérczi, Kristóf, et autres
Publié: (2024)

Exponential Time Approximation for Coloring 3-Colorable Graphs
par: Guruswami, Venkatesan, et autres
Publié: (2024)

Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs
par: Paul-Pena, Daniel, et autres
Publié: (2024)

A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
par: Ghanbari, Babak, et autres
Publié: (2026)

Subexponential and Parameterized Mixing Times of Glauber Dynamics on Independent Sets
par: Marin, Malory
Publié: (2025)

DRESS and the WL Hierarchy: Climbing One Deletion at a Time
par: Velilla, Eduar Castrillo
Publié: (2026)

Beware of the Classical Benchmark Instances for the Traveling Salesman Problem with Time Windows
par: Soulignac, Francisco J.
Publié: (2025)

Continuous Petri Nets for Fast Yield Computation: Polynomial-Time and MILP Approaches
par: Jordon, Addie, et autres
Publié: (2025)

Space-Efficient Hierholzer: Eulerian Cycles in $\mathrm{O}(m)$ Time and $\mathrm{O}(n)$ Space
par: Alaoui, Ziad Ismaili, et autres
Publié: (2025)

Fanciful Figurines flip Free Flood-It -- Polynomial-Time Miniature Painting on Co-gem-free Graphs
par: Rosenke, Christian, et autres
Publié: (2026)

Matrix Scaling: a New Heuristic for the Feedback Vertex Set Problem
par: Shook, James M., et autres
Publié: (2025)

On The Maximum Linear Arrangement Problem for Trees
par: Alemany-Puig, Lluís, et autres
Publié: (2023)

Linear-Sized Spectral Sparsifiers and the Kadison-Singer Problem
par: Paschalidis, Phevos, et autres
Publié: (2023)

Depth-13 Sorting Networks for 28 Channels
par: Wang, Chengu
Publié: (2025)

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
par: Wang, Chen, et autres
Publié: (2024)

Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound
par: Lill, Jonas, et autres
Publié: (2024)

Correcting matrix products over the ring of integers
par: Wu, Yu-Lun, et autres
Publié: (2023)

An algorithm with a delay of $\mathcal{O}(kΔ)$ for enumerating connected induced subgraphs of size $k$
par: Xiao, Chenglong, et autres
Publié: (2024)

Improved Space-Time Tradeoffs for Permutation Problems via Extremal Combinatorics
par: Ameli, Afrouz Jabal, et autres
Publié: (2026)

Approximately covering vertices by order-$5$ or longer paths
par: Gong, Mingyang, et autres
Publié: (2024)

Counting random $k$-SAT near the satisfiability threshold
par: Chen, Zongchen, et autres
Publié: (2024)

Sampling Balanced Forests of Grids in Polynomial Time
par: Cannon, Sarah, et autres
Publié: (2023)

A Polynomial-Time Approximation Algorithm for Complete Interval Minors
par: Bourneuf, Romain, et autres
Publié: (2025)

Average-Case Matrix Discrepancy: Asymptotics and Online Algorithms
par: Kunisky, Dmitriy, et autres
Publié: (2023)

String Matching with a Dynamic Pattern
par: Monteiro, Bruno, et autres
Publié: (2025)

Inverse matroid optimization under subset constraints
par: Bérczi, Kristóf, et autres
Publié: (2025)

Graph Coloring Below Guarantees via Co-Triangle Packing
par: Akmal, Shyan, et autres
Publié: (2025)

An Approximation Algorithm for Monotone Submodular Cost Allocation
par: Mizutani, Ryuhei
Publié: (2025)

Greedy Algorithms for Shortcut Sets and Hopsets
par: Bals, Ben, et autres
Publié: (2025)

Approximating Submodular Matroid-Constrained Partitioning
par: Bérczi, Kristóf, et autres
Publié: (2025)

A Simple and Fast $(3+\varepsilon)$-approximation for Constrained Correlation Clustering
par: Veldt, Nate
Publié: (2025)

UAIC_Twin_Width: An Exact yet Efficient Twin-Width Algorithm
par: Arhire, Andrei, et autres
Publié: (2025)