Holographic Computation of Balanced Succinct Permanent Instances ( Extended Abstract )

Abstract

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… (More)

7 Figures and Tables

Topics

  • Presentations referencing similar topics