scientific article
From MaRDI portal
Publication:3281059
zbMath0100.01002MaRDI QIDQ3281059
Publication date: 1961
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (32)
Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity ⋮ Quantified Derandomization: How to Find Water in the Ocean ⋮ An improved deterministic \#SAT algorithm for small De Morgan formulas ⋮ Complexity of the Realization of a Linear Boolean Function in the Class of π-Schemes ⋮ Correlation bounds and \#SAT algorithms for small linear-size circuits ⋮ On the shrinkage exponent for read-once formulae ⋮ Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits ⋮ A satisfiability algorithm and average-case hardness for formulas over the full binary basis ⋮ Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases ⋮ Constructive Relationships Between Algebraic Thickness and Normality ⋮ Parallelizable algebras ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Improved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower Bound ⋮ Unnamed Item ⋮ Circuit complexity of linear functions: gate elimination and feeble security ⋮ Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation ⋮ Amplification and Derandomization without Slowdown ⋮ ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO ⋮ Bounded Independence Plus Noise Fools Products ⋮ Local restrictions from the Furst-Saxe-Sipser paper ⋮ On convex complexity measures ⋮ Fourier concentration from shrinkage ⋮ Satisfiability algorithm for syntactic read-\(k\)-times branching programs ⋮ Negation-limited formulas ⋮ Formula complexity of a linear function in a \(k\)-ary basis ⋮ Sampling Lower Bounds: Boolean Average-Case and Permutations ⋮ Cubic Formula Size Lower Bounds Based on Compositions with Majority ⋮ Algorithms and lower bounds for de morgan formulas of low-communication leaf gates ⋮ Complexity of the realization of a linear function in the class of \(\Pi\)-circuits ⋮ Mining circuit lower bound proofs for meta-algorithms
This page was built for publication:
