Cover Image

Binary constraints on one additional variable can create exponential ascents

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cohen, David A., Jeavons, Peter G., Kaznatcheev, Artem, Alferez, Sofia Vazquez
Format:	Preprint
Published:	2026
Subjects:	Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Greed is slow on sparse graphs of oriented valued constraints
by: Kaznatcheev, Artem, et al.
Published: (2025)

All ascents exponential from valued constraint graphs of pathwidth three
by: Kaznatcheev, Artem, et al.
Published: (2026)

When is local search both effective and efficient?
by: Kaznatcheev, Artem, et al.
Published: (2024)

Local search for valued constraint satisfaction parameterized by treedepth
by: Kaznatcheev, Artem
Published: (2024)

Exponential Steepest Ascent from Valued Constraint Graphs of Pathwidth Four
by: Kaznatcheev, Artem, et al.
Published: (2024)

Optimal energy collection with rotational movements constraints in concentrated solar power plants
by: Díaz-Bañez, J. M., et al.
Published: (2024)

The one-visibility Localization game
by: Bonato, Anthony, et al.
Published: (2023)

Neighbour sum distinguishing edge-weightings with local constraints
by: Dailly, Antoine, et al.
Published: (2022)

Remote control system of a binary tree of switches -- I. constraints and inequalities
by: Golinelli, Olivier
Published: (2024)

Conditional Separation as a Binary Relation. A Coq Assisted Proof
by: Chancelier, Jean-Philippe, et al.
Published: (2021)

Search for an Immobile Hider on a Binary Tree with Unreliable Locational Information
by: Alpern, Steve, et al.
Published: (2023)

Sorting with constraints
by: Manas, A.
Published: (2025)

Phenotype control and elimination of variables in Boolean networks
by: Tonello, Elisa, et al.
Published: (2024)

Regular packing of rooted hyperforests with root constraints in hypergraphs
by: Hoppenot, Pierre, et al.
Published: (2023)

Some polynomial classes for the acyclic orientation with parity constraint problem
by: Gravier, Sylvain, et al.
Published: (2026)

Note about the complexity of the acyclic orientation with parity constraint problem
by: Gravier, Sylvain, et al.
Published: (2025)

Upper Bounds on the Average Height of Random Binary Trees
by: Benkner, Louisa Seelbach
Published: (2024)

Solving decision problems by distributed consensus with one-dimensional, binary, radius-$2$ cellular automata over cyclic configurations
by: Ruivo, Eurico, et al.
Published: (2025)

Combinatorial generation via permutation languages. VI. Binary trees
by: Gregor, Petr, et al.
Published: (2023)

Characterizing traces of processes defined by precedence and response constraints: an order theory approach
by: Dukes, Mark, et al.
Published: (2023)

Edge densities of drawings of graphs with one forbidden cell
by: Hahn, Benedikt, et al.
Published: (2025)

A concentration phenomenon for $h$-extra edge-connectivity reliability analysis of enhanced hypercubes $Q_{n,2}$ with exponentially many faulty links
by: Sun, Yali, et al.
Published: (2024)

Acyclic colourings of graphs with obstructions
by: Chuet, Quentin, et al.
Published: (2022)

Applying constraint programming to minimal lottery designs
by: Cushing, David, et al.
Published: (2023)

Path eccentricity of $k$-AT-free graphs and application on graphs with the consecutive ones property
by: Bastide, Paul, et al.
Published: (2024)

$K_{2,3}$-induced minor-free graphs admit quasi-isometry with additive distortion to graphs of tree-width at most two
by: Chakraborty, Dibyayan
Published: (2025)

Faster algorithms for graph homomorphism via tractable constraint satisfaction
by: Carbonnel, Clément
Published: (2026)

On minimum Venn diagrams
by: Brenner, Sofia, et al.
Published: (2025)

A Knowledge Compilation Take on Binary Polynomial Optimization
by: Capelli, Florent, et al.
Published: (2023)

A Formalization of Elementary Linear Algebra: Part I
by: Russinoff, David
Published: (2025)

A Formalization of Elementary Linear Algebra: Part II
by: Russinoff, David
Published: (2025)

Disproving two conjectures on the Hamiltonicity of Venn diagrams
by: Brenner, Sofia, et al.
Published: (2025)

A Courcelle-Type Metatheorem for Rank-Bounded Unconstrained Binary Optimization
by: Harary, Marc
Published: (2025)

Rank-one Boolean tensor factorization and the multilinear polytope
by: Del Pia, Alberto, et al.
Published: (2022)

Assembly in Directed Hypergraphs
by: Flamm, Christoph, et al.
Published: (2025)

A Weight Function Lemma Heuristic for Graph Pebbling
by: Bridi, G. A., et al.
Published: (2025)

Inverse matroid optimization under subset constraints
by: Bérczi, Kristóf, et al.
Published: (2025)

Circle graphs can be recognized in linear time
by: Paul, Christophe, et al.
Published: (2025)

Level Planarity Is More Difficult Than We Thought
by: Fink, Simon D., et al.
Published: (2024)

Unbalanced penalization: A new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms
by: Montanez-Barrera, Alejandro, et al.
Published: (2022)