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

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
• Theor. Comput. Sci.
• 2019
• Corpus ID: 8328989
A qualitative representation $\phi$ is like an ordinary representation of a relation algebra, but instead of requiring \$(a; b… Expand
Is this relevant?
2017
2017
• 2017
• Corpus ID: 119128673
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
• ICALP
• 2014
• Corpus ID: 28770167
We investigate a simple class of multi-prover interactive proof systems (classical non-local games), called binary constraint… Expand
Is this relevant?
Highly Cited
2011
Highly Cited
2011
A solution to a binary constraint satisfaction problem is a set of discrete values, one in each of a given set of domains… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
• CP
• 2004
• Corpus ID: 17204078
This article deals with global constraints for which the set of solutions can be recognized by an extended finite automaton whose… Expand
Is this relevant?
Highly Cited
1998
Highly Cited
1998
• AAAI/IAAI
• 1998
• Corpus ID: 3251018
It is well known that any non-binary discrete constraint satisfaction problem (CSP) can be translated into an equivalent binary… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
• IJCAI
• 1997
• Corpus ID: 18440225
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
• Artif. Intell.
• 1996
• Corpus ID: 16937959
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
• JACM
• 1994
• Corpus ID: 10633875
The concepts of binary constraint satisfaction problems can be naturally generalized to the relation algebras of Tarski. The… Expand
Is this relevant?
Highly Cited
1979
Highly Cited
1979
• Artif. Intell.
• 1979
• Corpus ID: 1324533
Abstract In this paper we explore the number of tree search operations required to solve binary constraint satisfaction problems… Expand
Is this relevant?