Probabilistically checkable arguments for all NP
type: Item
instance of: scholarly article
title: Probabilistically checkable arguments for all NP
DOI: 10.1007/978-3-031-58734-4_12
author: Shany Ben-David
publication date: 2024-11-13T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7943270
zbMATH Keywords: succinct probabilistically checkable argument
zbMATH Keywords: PCA
MaRDI profile type: Publication
cites work: Proof verification and the hardness of approximation problems
cites work: On problems without polynomial kernels
cites work: Q6126256
cites work: Fine-grained Complexity Meets IP = PSPACE
cites work: Correlation intractability and SNARGs from sub-exponential DDH
cites work: New Limits to Classical and Quantum Instance Compression
cites work: Q3549693
cites work: On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
cites work: SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
cites work: How to delegate computations publicly
cites work: Probabilistically Checkable Arguments
cites work: Somewhere statistical soundness, post-quantum security, and SNARGs
cites work: Advances in Cryptology - EUROCRYPT 2004
description: scientific article; zbMATH DE number 7943270