Proof system representations of degrees of disjoint NP-pairs
type: Item
instance of: scholarly article
title: Proof system representations of degrees of disjoint NP-pairs
zbMATH Open document ID: 1260.68149
author: Liyu Zhang
published in: Information Processing Letters
publication date: 2013-03-28T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 03F20
zbMATH DE Number: 6149184
zbMATH Keywords: computational complexity
zbMATH Keywords: degrees of disjoint NP-pairs
zbMATH Keywords: propositional proof systems
zbMATH Keywords: canonical NP-pairs
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.01.001
OpenAlex ID: W1969650910
cites work: Q3692867
cites work: Theory and Applications of Models of Computation
cites work: Classes of representable disjoint \textsf{NP}-pairs
cites work: Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes
cites work: The relative efficiency of propositional proof systems
cites work: Disjoint NP-Pairs
cites work: Canonical disjoint NP-pairs of propositional proof systems
cites work: THE INFORMATIONAL CONTENT OF CANONICAL DISJOINT NP-PAIRS
cites work: Complexity Measures for Public-Key Cryptosystems
cites work: Computability and complexity theory
cites work: Inseparability and Strong Hypotheses for Disjoint NP Pairs.
cites work: On reducibility and symmetry of disjoint NP pairs.
cites work: Q5422270
DOI: 10.1016/J.IPL.2011.01.001
description: scientific article; zbMATH DE number 6149184