:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chew, Leroy, de Colnet, Alexis, Slivovsky, Friedrich, Szeider, Stefan
Format:	Preprint
Publié:	2024
Sujets:	Computational Complexity
Accès en ligne:	https://arxiv.org/abs/2402.00542
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Towards Uniform Certification in QBF
par: Chew, Leroy, et autres
Publié: (2022)

Compilation and Fast Model Counting beyond CNF
par: de Colnet, Alexis, et autres
Publié: (2025)

Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution
par: Beyersdorff, Olaf, et autres
Publié: (2021)

Proofdoors and Efficiency of CDCL Solvers
par: Singh, Sunidhi, et autres
Publié: (2026)

Counting and Sampling Traces in Regular Languages
par: de Colnet, Alexis, et autres
Publié: (2025)

Better Extension Variables in DQBF via Independence
par: Chew, Leroy, et autres
Publié: (2025)

Extending CDCL to disjunctions of parity equations
par: Beame, Paul, et autres
Publié: (2026)

An Exponential Separation between Deterministic CDCL and DPLL Solvers
par: Samar, Sahil, et autres
Publié: (2026)

Small unsatisfiable $k$-CNFs with bounded literal occurrence
par: Zhang, Tianwei, et autres
Publié: (2024)

Model Counting for Dependency Quantified Boolean Formulas
par: Fung, Long-Hin, et autres
Publié: (2025)

Explaining Decisions in ML Models: a Parameterized Complexity Analysis
par: Ordyniak, Sebastian, et autres
Publié: (2024)

Average-Case Hardness of Parity Problems: Orthogonal Vectors, k-SUM and More
par: Dalirrooyfard, Mina, et autres
Publié: (2025)

Average-Case Hardness of Binary-Encoded Clique in Proof and Communication Complexity
par: de Rezende, Susanna F., et autres
Publié: (2026)

Exponential Separation Between Powers of Regular and General Resolution Over Parities
par: Bhattacharya, Sreejata Kishor, et autres
Publié: (2024)

Lower Bounds for Bit Pigeonhole Principles in Bounded-Depth Resolution over Parities
par: Byramji, Farzan, et autres
Publié: (2025)

Hard Clique Formulas for Resolution
par: Atserias, Albert
Publié: (2026)

Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication
par: Riazanov, Artur, et autres
Publié: (2025)

Parity Tests with Ties
par: Kupfer, Ron
Publié: (2026)

Hard QBFs for Merge Resolution
par: Beyersdorff, Olaf, et autres
Publié: (2020)

Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams
par: Khadiev, Kamil, et autres
Publié: (2017)

Improved Hardness Results for Learning Intersections of Halfspaces
par: Tiegel, Stefan
Publié: (2024)

Transcendental Encoding conjecture
par: Keshavan, Anand Kumar, et autres
Publié: (2025)

Carrying is Hard: Exploring the Gap between Hardness for NP and PSPACE for the Hanano and Jelly no Puzzles
par: Chavrimootoo, Michael C., et autres
Publié: (2026)

Hardness of SetCover Reoptimization
par: Jansen, Klaus, et autres
Publié: (2025)

On the Hardness of the Drone Delivery Problem
par: Bartlmae, Simon, et autres
Publié: (2025)

Hardness Amplification via Group Theory
par: Nareddy, Tejas, et autres
Publié: (2024)

Bounds for Hardness Condensation in the Query Model
par: Kayal, Chandrima, et autres
Publié: (2026)

Hardness of clique approximation for monotone circuits
par: Błasiok, Jarosław, et autres
Publié: (2025)

Are Depth-2 Regular Expressions Hard to Intersect?
par: Ascone, Rocco, et autres
Publié: (2025)

Near Optimal Hardness of Approximating $k$-CSP
par: Minzer, Dor, et autres
Publié: (2025)

Higher Hardness Results for the Reconfiguration of Odd Matchings
par: Dorfer, Joseph
Publié: (2026)

Hard-to-Sample Distributions from Robust Extractors
par: Byramji, Farzan, et autres
Publié: (2026)

Tetris is Hard with Just One Piece Type
par: MIT Hardness Group, et autres
Publié: (2026)

On the Hardness of Order Finding and Equivalence Testing for ROABPs
par: Ramya, C., et autres
Publié: (2025)

Hard CNF Instances for Ideal Proof Systems
par: Hakoniemi, Tuomas, et autres
Publié: (2026)

New Techniques for Constructing Rare-Case Hard Functions
par: Nareddy, Tejas, et autres
Publié: (2024)

Optimal Proof Systems for Complex Sets are Hard to Find
par: Egidy, Fabian, et autres
Publié: (2024)

Compression of Voxelized Vector Field Data by Boxes is Hard
par: Zhang, Simon
Publié: (2025)

On the Hardness of Finding Temporally Connected Subgraphs of Any Size
par: Casteigts, Arnaud, et autres
Publié: (2026)

Parity $\notin$ QAC0 $\iff$ QAC0 is Fourier-Concentrated
par: Gretta, Lucas, et autres
Publié: (2026)