OurBigBook About$ Donate
 Sign in Sign up

MAX-3LIN-EQN

Wikipedia Bot (@wikibot, 0) Mathematics History of mathematics Mathematical problems Computational problems NP-hard problems
 0 By others on same topic  0 Discussions Create my own version
MAX-3LIN-EQN is a computational problem that falls within the realm of optimization and computational complexity theory. It is a specific case of the broader MAX-CSP (Maximum Constraint Satisfaction Problem) problems. In MAX-3LIN-EQN, the goal is to find an assignment of values (often binary, i.e., 0 or 1) to a set of variables such that the number of satisfied equations is maximized. Each equation is linear and involves three variables.

 Ancestors (6)

  1. NP-hard problems
  2. Computational problems
  3. Mathematical problems
  4. History of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook