| Display title | Decomposition method (constraint satisfaction) |
| Default sort key | Decomposition method (constraint satisfaction) |
| Page length (in bytes) | 43,551 |
| Namespace ID | 0 |
| Page ID | 4706795 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | Fewer than 30 watchers |
| Number of redirects to this page | 3 |
| Counted as a content page | Yes |
| Wikidata item ID | Q5249566 |
| Central description | translates a constraint satisfaction problem into another constraint satisfaction problem that is binary and acyclic. Decomposition methods work by grouping variables into sets, and solving a subproblem for each set |
| Page views in the past 30 days | |
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
| Page creator | Tizio (talk | contribs) |
| Date of page creation | 15:09, 11 April 2006 |
| Latest editor | GreenC bot (talk | contribs) |
| Date of latest edit | 06:51, 26 January 2025 |
| Total number of edits | 134 |
| Recent number of edits (within past 30 days) | 0 |
| Recent number of distinct authors | 0 |
| Hidden categories (6) | This page is a member of 6 hidden categories (help):
|
| Transcluded templates (51) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |
