scientific article; zbMATH DE number 7243671

MaRDI QIDQ5119389

Jan Krajíček

Publication date: 4 September 2020

Full work available at URL: https://arxiv.org/abs/2004.02448

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• Bounded arithmetic and the polynomial hierarchy
• ON THE PROOF COMPLEXITY OF THE NISAN–WIGDERSON GENERATOR BASED ON A HARD NP ∩ coNP FUNCTION
• The strength of replacement in weak arithmetic
• Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds

This page was built for publication: