The following pages link to (Q3281059):
Displaying 31 items.
- An improved deterministic \#SAT algorithm for small De Morgan formulas (Q334923) (← links)
- Correlation bounds and \#SAT algorithms for small linear-size circuits (Q344759) (← links)
- A satisfiability algorithm and average-case hardness for formulas over the full binary basis (Q354655) (← links)
- Local restrictions from the Furst-Saxe-Sipser paper (Q519884) (← links)
- Negation-limited formulas (Q729897) (← links)
- On convex complexity measures (Q964405) (← links)
- On the shrinkage exponent for read-once formulae (Q1367534) (← links)
- Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity (Q1616616) (← links)
- Circuit complexity of linear functions: gate elimination and feeble security (Q1946842) (← links)
- Fourier concentration from shrinkage (Q2012185) (← links)
- Satisfiability algorithm for syntactic read-\(k\)-times branching programs (Q2032296) (← links)
- Formula complexity of a linear function in a \(k\)-ary basis (Q2037681) (← links)
- Mining circuit lower bound proofs for meta-algorithms (Q2351392) (← links)
- Complexity of the realization of a linear function in the class of \(\Pi\)-circuits (Q2547883) (← links)
- Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases (Q2946392) (← links)
- Constructive Relationships Between Algebraic Thickness and Normality (Q2947873) (← links)
- Improved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower Bound (Q2963581) (← links)
- Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation (Q2968148) (← links)
- Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits (Q3196385) (← links)
- Parallelizable algebras (Q3773330) (← links)
- Complexity of the Realization of a Linear Boolean Function in the Class of π-Schemes (Q4558295) (← links)
- Bounded Independence Plus Noise Fools Products (Q4641587) (← links)
- (Q5002674) (← links)
- (Q5002692) (← links)
- Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
- Cubic Formula Size Lower Bounds Based on Compositions with Majority (Q5090412) (← links)
- Algorithms and lower bounds for de morgan formulas of low-communication leaf gates (Q5092464) (← links)
- Amplification and Derandomization without Slowdown (Q5129234) (← links)
- ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO (Q5151450) (← links)
- Sampling Lower Bounds: Boolean Average-Case and Permutations (Q5216796) (← links)
- (Q5878634) (← links)
