Jump to content

Talk:Constraint composite graph

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Jackzhp (talk | contribs) at 16:42, 30 September 2018. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconComputing
WikiProject iconThis article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing
???This article has not yet received a rating on the project's importance scale.


Universal procedure

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]

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Constraint_composite_graph&oldid=861868061"