Publication:3281059
From MaRDI portal
zbMath0100.01002MaRDI QIDQ3281059
Publication date: 1961
Related Items
Complexity of the Realization of a Linear Boolean Function in the Class of π-Schemes, Bounded Independence Plus Noise Fools Products, Unnamed Item, Unnamed Item, Quantified Derandomization: How to Find Water in the Ocean, Amplification and Derandomization without Slowdown, ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO, 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, Unnamed Item, An improved deterministic \#SAT algorithm for small De Morgan formulas, Correlation bounds and \#SAT algorithms for small linear-size circuits, A satisfiability algorithm and average-case hardness for formulas over the full binary basis, Local restrictions from the Furst-Saxe-Sipser paper, Negation-limited formulas, On convex complexity measures, On the shrinkage exponent for read-once formulae, Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity, Circuit complexity of linear functions: gate elimination and feeble security, Fourier concentration from shrinkage, Satisfiability algorithm for syntactic read-\(k\)-times branching programs, Formula complexity of a linear function in a \(k\)-ary basis, Mining circuit lower bound proofs for meta-algorithms, Complexity of the realization of a linear function in the class of \(\Pi\)-circuits, Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases, Constructive Relationships Between Algebraic Thickness and Normality, Improved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower Bound, Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation, Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits, Parallelizable algebras
