A PCP characterization of NP with optimal amortized query complexity
type: Item
instance of: scholarly article
title: A PCP characterization of NP with optimal amortized query complexity
zbMATH Open document ID: 1296.68060
DOI: 10.1145/335305.335329
author: Alex Samorodnitsky
author: Luca Trevisan
published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing
publication date: 2014-09-26T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 6347985
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1145/335305.335329
OpenAlex ID: W2091921997
description: scientific article