scientific article; zbMATH DE number 806753
From MaRDI portal
zbMath0838.03044MaRDI QIDQ4850554
Publication date: 6 June 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30)
Related Items
Circuit principles and weak pigeonhole variants, Simplified lower bounds for propositional proofs, Algebraic methods and bounded formulas, A proof of the Kahn–Kalai conjecture, On parallel hierarchies and R ki, Feebly secure cryptographic primitives, Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting), Forcing in Finite Structures, \(S_{k,\text{exp}}\) does not prove \(\text{NP} = \text{co-NP}\) uniformly, Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution, Feasibly constructive proofs of succinct weak circuit lower bounds, Polynomial time ultrapowers and the consistency of circuit lower bounds, Improved bounds for the sunflower lemma, Multifunction algebras and the provability of \(PH\downarrow\), Unnamed Item, Mining circuit lower bound proofs for meta-algorithms, Unifying known lower bounds via geometric complexity theory
