Jump to content

Talk:Constraint composite graph

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Cewbot (talk | contribs) at 23:37, 30 January 2024 (Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}.). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Universal procedure

[edit]

is there any universal procedure to turn a constrained combination satisfiability problem into an algebraic satisfiability problem? Jackzhp (talk) 16:33, 30 September 2018 (UTC)[reply]