Jump to content

Talk:Holographic algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Datamance (talk | contribs) at 02:20, 5 December 2020 (Problem with specific example: new section). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconComputing Stub‑class
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.
StubThis article has been rated as Stub-class on Wikipedia's content assessment scale.
???This article has not yet received a rating on the project's importance scale.
Note icon
This article has been automatically rated by a bot or other tool as Stub-class because it uses a stub template. Please ensure the assessment is correct before removing the |auto= parameter.

"^ a b c d Holographic Algorithms: From Art to Science, by Jin-Yi Cai and Pinyan Lu, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, 2007" this link is broken —Preceding unsigned comment added by 212.76.37.154 (talk) 16:41, 6 September 2009 (UTC)[reply]

It works now. Bender2k14 (talk) 05:08, 14 October 2009 (UTC)[reply]

Expert

BTW, I am an expert in holographic algorithms. Eventually I will reorder, elaborate existing, and add content. If anyone has questions that they would like the article to answer, please ask them here. I am also interested in suggestions for ordering and grouping content. Bender2k14 (talk) 18:28, 1 September 2010 (UTC)[reply]

I am working on a draft that will have major changes/additions. Bender2k14 (talk) 18:15, 1 May 2011 (UTC)[reply]

Problem with specific example

Bender2k14 -

For vertex cover: if you're starting with a 3-regular graph (really, any graph) and doing a 2-stretch on it, then by virtue of the graph transformation you just did, the constraint to your Holant definition should be , no? doesn't really make sense, since the introduction of is just splitting edges (and both new resultant edges will be the same variable).

I think you probably want to switch the last two arguments, so that it reads - makes much more sense as a constraint, since you're just looking for "at least one incident edge" (out of the three implied by the definition of 3-regular)

Regrettably, this messes up the math as well. What you should have is:

Once we have these correct vector logic constructs, we can actually carry out the reduction:

Let me know if this makes sense / if I'm missing anything. Thanks!

Datamance (talk) 02:20, 5 December 2020 (UTC)[reply]