Succinct Permanent Is NEXP-Hard with Many Hard Instances

DOI10.1007/978-3-642-38233-8_16zbMath1382.68087OpenAlexW178079920WikidataQ56806121 ScholiaQ56806121MaRDI QIDQ4924648

Dan Gutfreund, Nova Fandina, Shlomi Dolev

Publication date: 7 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38233-8_16

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Succinct Permanent Is NEXP-Hard with Many Hard Instances