scientific article; zbMATH DE number 7215291
From MaRDI portal
Publication:5114830
Jan Krajíček, J. Bydžovský, Igor C. Oliveira
Publication date: 26 June 2020
Full work available at URL: https://arxiv.org/abs/1905.12935
Title of this publication is not available (Why is that?)
Cited In (6)
- A quasi-lower bound on the consistency strength of PFA
- Approximate counting and NP search problems
- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024
- Lower bounds: from circuits to QBF proof systems
- Indistinguishability obfuscation, range avoidance, and bounded arithmetic
- Unprovability of strong complexity lower bounds in bounded arithmetic
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5114830)
