:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Gupta, Chetan, Tewari, Raghunath, Sharma, Vimal Raj
Format:	Preprint
Publié:	2025
Sujets:	Computational Complexity F.2.2
Accès en ligne:	https://arxiv.org/abs/2511.21217
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Lossy Catalytic Computation
par: Gupta, Chetan, et autres
Publié: (2024)

On Solving Reachability in Grid Digraphs using a Psuedoseparator
par: Jain, Rahul, et autres
Publié: (2019)

Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs
par: de Rezende, Susanna F., et autres
Publié: (2019)

On Minimum Maximal Distance-k Matchings
par: Kartynnik, Yury, et autres
Publié: (2016)

Graph Threading with Turn Costs
par: Demaine, Erik D., et autres
Publié: (2024)

Thin Tree Verification is coNP-Complete
par: Moayyedi, Alice
Publié: (2025)

NP-Completeness Proofs of Puzzles using the T-Metacell Framework
par: Kiatchaipipat, Nattapol, et autres
Publié: (2025)

When Does Sparsity Help for k-Independent Set in Hypergraphs and Other Boolean CSPs?
par: Fritsch, Timo, et autres
Publié: (2026)

Fast Simulation of Cellular Automata by Self-Composition
par: Natal, Joseph, et autres
Publié: (2024)

A Polynomial Time Algorithm for 3SAT
par: Quigley, Robert
Publié: (2024)

Complexity of Firefighting on Graphs
par: Althoetmar, Julius, et autres
Publié: (2025)

Approximate all-pairs Hamming distances and 0-1 matrix multiplication
par: Kowaluk, Miroslaw, et autres
Publié: (2025)

Computing the Polytope Diameter is Even Harder than NP-hard (Already for Perfect Matchings)
par: Wulf, Lasse
Publié: (2025)

Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity
par: Knop, Dušan, et autres
Publié: (2017)

Direct Sums for Parity Decision Trees
par: Besselman, Tyler, et autres
Publié: (2024)

The Complexity of Graph Exploration Games
par: Fuchs, Janosch, et autres
Publié: (2023)

Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction
par: Krithika, R., et autres
Publié: (2023)

On the Complexity of Determinations
par: Hellerstein, Joseph M.
Publié: (2026)

Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
par: Conneryd, Jonas, et autres
Publié: (2025)

A Decomposition Approach to the Weighted $k$-server Problem
par: Ayyadevara, Nikhil, et autres
Publié: (2024)

A Compendium of Subset Search Problems and Reductions relating to the Parsimonious Property
par: Bartlett, Celina Janet
Publié: (2025)

A Fine-Grained Complexity View on Propositional Abduction -- Algorithms and Lower Bounds
par: Lagerkvist, Victor, et autres
Publié: (2025)

The complexity of finding coset-generating polymorphisms and the promise metaproblem
par: Bodirsky, Manuel, et autres
Publié: (2026)

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
par: Dvořák, Pavel, et autres
Publié: (2017)

Realizing temporal graphs from fastest travel times
par: Klobas, Nina, et autres
Publié: (2023)

A Piecewise Approach for the Analysis of Exact Algorithms
par: Clinch, Katie, et autres
Publié: (2024)

Lower Bounds for CSP Hierarchies Through Ideal Reduction
par: Conneryd, Jonas, et autres
Publié: (2025)

Proving Unsatisfiability with Hitting Formulas
par: Filmus, Yuval, et autres
Publié: (2023)

On Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds in the MPC Model
par: Lingas, Andrzej
Publié: (2026)

Liquid Amortization: Proving Amortized Complexity with LiquidHaskell (Functional Pearl)
par: van Brügge, Jan
Publié: (2024)

On Finding Randomly Planted Cliques in Arbitrary Graphs
par: Agrimonti, Francesco, et autres
Publié: (2025)

The Word Problem for Products of Symmetric Groups
par: Simon, Hans U.
Publié: (2025)

Identity Testing for Circuits with Exponentiation Gates
par: Li, Jiatu, et autres
Publié: (2025)

On the difficulty of order constrained pattern matching with applications to feature matching based malware detection
par: Liyanage, Adiesha, et autres
Publié: (2025)

Towards universally optimal sorting algorithms
par: Sen, Sandeep
Publié: (2025)

NP-Completeness Proofs of All or Nothing, Water Walk, and Remembered Length Using the T-Metacell Framework
par: Eua-anant, Pakapim, et autres
Publié: (2025)

Spanning Trees Minimizing Branching Costs
par: Gargano, Luisa, et autres
Publié: (2024)

An Algorithm for a Variation of the Shortest Common Superstring Problem
par: Gilfanov, Arthur
Publié: (2024)

On Small-depth Frege Proofs for PHP
par: Håstad, Johan
Publié: (2024)

How do humans succeed in tasks like proving Fermat's Theorem or predicting the Higgs boson?
par: Levin, Leonid A.
Publié: (2022)