Hardness amplification in proof complexity
type: Item
instance of: scholarly article
title: Hardness amplification in proof complexity
zbMATH Open document ID: 1293.03030
DOI: 10.1145/1806689.1806703
author: Trinh Huynh
author: Toniann Pitassi
author: Paul Beame
published in: Proceedings of the forty-second ACM symposium on Theory of computing
publication date: 2014-08-13T00:00:00Z
Mathematics Subject Classification ID: 03F20
zbMATH DE Number: 6330047
zbMATH Keywords: communication complexity
zbMATH Keywords: proof complexity
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1145/1806689.1806703
OpenAlex ID: W2160909640
description: scientific article; zbMATH DE number 6330047