We present polynomial-time algorithms to decide if a given counting problem has a holographic reduction to another problem defined by affine or product-type ...

Jul 29, 2013 · More specifically, we present polynomial-time algorithms to decide if a given counting problem has a holographic reduction to another problem ...

We present a polynomial time algorithm to decide if a given counting problem has a holographic algorithm over general graphs using the affine or product-type.

Jan 5, 2018 · Holographic algorithms introduced by Valiant are composed of two ingredients: matchgates, which are gadgets realizing local constraint functions ...

Holographic algorithms introduced by Valiant have two ingredients: matchgates, which are gadgets realizing local constraint functions by weighted planar ...

Holographic algorithms based on matchgates were introduced by Valiant. These algorithms run in polynomial-time and are intrinsically for planar problems.

A polynomial time algorithm is presented to decide if a given counting problem has a holographic algorithm using the affine or product-type constraint ...

In this paper we propose a new kind of reduction that allows for gadgets with many-to-many correspondences, in which the individual correspondences among the ...

Jul 11, 2014 · When all these are satisfied, valid transformations are restricted to polynomially many. Heng Guo (CS, UW-Madison). General Holographic ...

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev. Hosted as a part of SLEBOK on ...