Skip to content
EntityQ1128326· pop 15· linked from 175 articles

Удовлетворение ограничений

Sign in to save

Also known as CSP

mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations

In the Vinony graph

Vinony's link graph records 175 inbound references to Удовлетворение ограничений, and connects out to mathematics, algorithm and Boolean algebra.

Vinony files it under Constraint programming and NP-complete problems.

Vinony links it to 14 Wikipedia language editions.

Wikidata facts

Show 2 more facts
computational complexity
NP-complete
Sources (2)

via Wikidata · CC0

Connections

Categories