# Holographic algorithm

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

2018

- Inf. Comput.
- 2018

Holographic algorithms introduced by Valiant are composed of two ingredients: matchgates, which are gadgets realizing local… (More)

Is this relevant?

2017

2017

- SIAM J. Comput.
- 2017

Valiant introduced matchgate computation and holographic algorithms. A number of seemingly exponential time problems can be… (More)

Is this relevant?

2011

2011

- IEEE Transactions on Information Theory
- 2011

This paper stands at the intersection of two distinct lines of research. One line is “holographic algorithms,” a powerful… (More)

Is this relevant?

2010

2010

- computational complexity
- 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

- ArXiv
- 2009

The theory of holographic algorithms, which are polynomial time algorithms for certain combinatorial counting problems, yields… (More)

Is this relevant?

2009

2009

- Theor. Comput. Sci.
- 2009

Valiant’s theory of holographic algorithms is a novel methodology to achieve exponential speedups in computation. A fundamental… (More)

Is this relevant?

2008

2008

- 49th Annual IEEE Symposium on Foundations of…
- 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

- SODA
- 2008

Holographic algorithms were introduced by Valiant as a new methodology to derive polynomial time algorithms. Here information and… (More)

Is this relevant?

2006

2006

- Electronic Colloquium on Computational Complexity
- 2006

We establish a 1-1 correspondence between Valiant’s character theory of matchgate/matchcircuit [14] and his signature theory of… (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- 45th Annual IEEE Symposium on Foundations of…
- 2004

We introduce a new notion of efficient reduction among computational problems. Classical reductions involve gadgets that map… (More)

Is this relevant?