The following pages link to (Q5743451):
Displayed 33 items.
- The relative exponential time complexity of approximate counting satisfying assignments (Q309794) (← links)
- 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)
- A moderately exponential time algorithm for \(k\)-IBDD satisfiability (Q722517) (← links)
- Solving sparse instances of Max SAT via width reduction and greedy restriction (Q905695) (← links)
- Local reduction (Q1641001) (← links)
- Gate elimination: circuit size lower bounds and \#SAT upper bounds (Q1704573) (← links)
- Fourier concentration from shrinkage (Q2012185) (← links)
- Satisfiability algorithm for syntactic read-\(k\)-times branching programs (Q2032296) (← links)
- CNF satisfiability in a subspace and related problems (Q2093572) (← links)
- Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression (Q2316930) (← links)
- Mining circuit lower bound proofs for meta-algorithms (Q2351392) (← links)
- Exploiting independent subformulas: a faster approximation scheme for \(\# k\)-SAT (Q2450932) (← links)
- Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
- The Relative Exponential Time Complexity of Approximate Counting Satisfying Assignments (Q2946032) (← links)
- Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits (Q3196385) (← links)
- A Moderately Exponential Time Algorithm for k-IBDD Satisfiability (Q3449853) (← links)
- Approximating Boolean Functions with Depth-2 Circuits (Q3451753) (← links)
- On polynomial approximations to AC (Q4633319) (← links)
- What Circuit Classes Can Be Learned with Non-Trivial Savings? (Q4638080) (← links)
- Bounded Independence Plus Noise Fools Products (Q4641587) (← links)
- Agnostic Learning from Tolerant Natural Proofs (Q5002638) (← links)
- (Q5002674) (← links)
- (Q5005182) (← links)
- (Q5009555) (← links)
- Criticality of regular formulas (Q5091751) (← links)
- Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs (Q5136279) (← links)
- Sampling Lower Bounds: Boolean Average-Case and Permutations (Q5216796) (← links)
- (Q5875501) (← links)
- Algorithms and lower bounds for comparator circuits from shrinkage (Q6107895) (← links)
- Unconditionally secure NIZK in the fine-grained setting (Q6132420) (← links)
- Paradigms for Unconditional Pseudorandom Generators (Q6149335) (← links)