ELECTRO-OPTICS  LABORATORY

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).