Holographic computation of balanced succinct permanent instances (Extended abstract)

Shlomi Dolev, Nova Fandina, Joseph Rosen

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


Galperin and Wigderson proposed a succinct representation for graphs, that uses number of bits that is logarithmic in the number of nodes. They proved complexity results for various decision problems on graph properties, when the graph is given in a succinct representation. Later, Papadimitriou and Yannakakis showed, that under the same succinct encoding method, certain class of decision problems on graph properties becomes exponentially hard. In this paper we consider the complexity of the Permanent problem when the graph/matrix is given in a restricted succinct representation. We present an optical architecture that is based on the holographic concept for solving balanced succinct permanent problem. Holography enables to have exponential copying (roughly, n ×n in each iteration) rather than constant copying (e.g., doubling in each iteration).

Original languageEnglish
Title of host publicationOptical Supercomputing - Third International Workshop, OSC 2010, Revised Selected Papers
Number of pages13
StatePublished - 29 Jul 2011
Event3rd International Workshop on Optical Supercomputing, OSC 2010 - Bertinoro, Italy
Duration: 17 Nov 201019 Nov 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6748 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference3rd International Workshop on Optical Supercomputing, OSC 2010

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Holographic computation of balanced succinct permanent instances (Extended abstract)'. Together they form a unique fingerprint.

Cite this