scientific article; zbMATH DE number 5604094
From MaRDI portal
Publication:3395977
Cited in
(8)- What one has to know when attacking \(\mathsf{P}\) vs.\(\mathsf{NP}\)
- Emptiness problems for integer circuits
- Using the renormalization group to classify Boolean functions
- Complexity barriers as independence
- Understanding the thermodynamics of computation: a pedagogical overview
- A note on da Costa-Doria ``exotic formalizations
- Towards PNP from extended Frege lower bounds
- Computing equilibria: a computational complexity perspective
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 Q3395977)