Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Binary constraint

A binary constraint, in mathematical optimization, is a constraint that involves exactly two variables. For example, consider the n-queens problem… Expand
Wikipedia

Related topics

Related topics

7 relations
Complexity of constraint satisfactionConstraint satisfaction dual problemDecomposition method (constraint satisfaction)List of numerical analysis topics
Expand

Broader (1)

Constraint programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Algebraic foundations for qualitative calculi and networks
A qualitative representation $\phi$ is like an ordinary representation of a relation algebra, but instead of requiring $(a; b… Expand
  • figure 1
  • figure 2
Is this relevant?
2017
2017
A synchronous game for binary constraint systems
Recently, Slofstra proved that the set of quantum correlations is not closed. We prove that the set of synchronous quantum… Expand
Is this relevant?
2014
2014
Characterization of Binary Constraint System Games
We investigate a simple class of multi-prover interactive proof systems (classical non-local games), called binary constraint… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
A solution to a binary constraint satisfaction problem is a set of discrete values, one in each of a given set of domains… Expand
  • figure 5
  • figure 10
  • table III
  • table II
  • figure 13
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Deriving Filtering Algorithms from Constraint Checkers
This article deals with global constraints for which the set of solutions can be recognized by an extended finite automaton whose… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
1998
Highly Cited
1998
On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems
It is well known that any non-binary discrete constraint satisfaction problem (CSP) can be translated into an equivalent binary… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 2
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Arc Consistency for General Constraint Networks: Preliminary Results
486,344. Roller bearings. BENEDEK, E. K. March 15, 1937, No. 7567. [Class 12 (i)] A high-speed heavyload needle roller bearing… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Locating the Phase Transition in Binary Constraint Satisfaction Problems
Abstract The phase transition in binary constraint satisfaction problems, i.e. the transition from a region in which almost all… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
On binary constraint problems
The concepts of binary constraint satisfaction problems can be naturally generalized to the relation algebras of Tarski. The… Expand
  • table II
  • table IV
  • table V
  • table VI
  • figure 2
Is this relevant?
Highly Cited
1979
Highly Cited
1979
Increasing Tree Search Efficiency for Constraint Satisfaction Problems
Abstract In this paper we explore the number of tree search operations required to solve binary constraint satisfaction problems… Expand
  • figure 4
  • figure 5
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE