Holographic algorithm

Known as: Accidental algorithm, Holant, Holographic algorithms 
In computer science, a holographic algorithm is an algorithm that uses a holographic reduction. A holographic reduction is a constant-time reduction… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Holographic algorithms introduced by Valiant are composed of two ingredients: matchgates, which are gadgets realizing local… (More)
  • table 1
  • figure 1
Is this relevant?
2017
2017
Valiant introduced matchgate computation and holographic algorithms. A number of seemingly exponential time problems can be… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
This paper stands at the intersection of two distinct lines of research. One line is “holographic algorithms,” a powerful… (More)
  • figure 1
  • figure 5
  • figure 6
  • figure 7
  • figure 8
Is this relevant?
2010
2010
We define the notion of diversity for families of finite functions and express the limitations of a simple class of holographic… (More)
Is this relevant?
2009
2009
The theory of holographic algorithms, which are polynomial time algorithms for certain combinatorial counting problems, yields… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2009
2009
Valiant’s theory of holographic algorithms is a novel methodology to achieve exponential speedups in computation. A fundamental… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 6
  • figure 5
Is this relevant?
2008
2008
We propose a new method to prove complexity dichotomy theorems. First we introduce Fibonacci gates which provide a new class of… (More)
Is this relevant?
2008
2008
Holographic algorithms were introduced by Valiant as a new methodology to derive polynomial time algorithms. Here information and… (More)
  • figure 1
  • figure 3
  • figure 2
Is this relevant?
2006
2006
We establish a 1-1 correspondence between Valiant’s character theory of matchgate/matchcircuit [14] and his signature theory of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We introduce a new notion of efficient reduction among computational problems. Classical reductions involve gadgets that map… (More)
  • figure 2
  • figure 3
Is this relevant?