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…

Papers overview

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

2019

Unique prime factorization of integers is taught in every high school. We define and explore a notion of unique prime…

2017

This issue should reach your hands or screen in December 2017, as the new year approaches. Perhaps you are wondering how to best…

2016

Holant problem is a general framework to study the computational complexity of counting problems. We prove a complexity dichotomy…

2015

2014

We use micromagnetic simulations to demonstrate spin-wave-based, optically-inspired computing primitives in nanomagnetic devices…

2012

An essential problem in the design of holographic algorithms is to decide whether the required signatures can be realized by…

2011

There has been remarkable progress in the classification program of the complexity of counting problems. This program is carried…

2010

The BelSPO project HOLANT aims to determine how the climate of coastal (Sub)Antarctic regions has varied during the Holocene a d…

2008

In the theory of holographic algorithms proposed by Valiant, computation is expressed and processed in terms of signatures. We…

2007

We introduce Fibonacci gates as a polynomial time computable primitive, and develop a theory of holographic algorithms based on…