The following pages link to Suguru Tamaki (Q354654):
Displayed 30 items.
- A satisfiability algorithm and average-case hardness for formulas over the full binary basis (Q354655) (← links)
- Derandomizing the HSSW algorithm for 3-SAT (Q378221) (← links)
- Local restrictions from the Furst-Saxe-Sipser paper (Q519884) (← links)
- On the Boolean connectivity problem for Horn relations (Q608293) (← links)
- An exact algorithm for the Boolean connectivity problem for \(k\)-CNF (Q638525) (← links)
- Solving sparse instances of Max SAT via width reduction and greedy restriction (Q905695) (← links)
- Gate elimination: circuit size lower bounds and \#SAT upper bounds (Q1704573) (← links)
- The complexity of the Hajós calculus for planar graphs (Q2268877) (← links)
- An improved fixed-parameter algorithm for max-cut parameterized by crossing number (Q2301753) (← links)
- Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression (Q2316930) (← links)
- Improved exact algorithms for mildly sparse instances of MAX SAT (Q2405896) (← links)
- Quantum query complexity of unitary operator discrimination (Q2412421) (← links)
- Exploiting partial knowledge of satisfying assignments (Q2643304) (← links)
- Linear programming, width-1 CSPs, and robust satisfaction (Q2826079) (← links)
- (Q2969636) (← links)
- Improved Randomized Algorithms for 3-SAT (Q3060723) (← links)
- Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues (Q3167406) (← links)
- Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction (Q3192053) (← links)
- A query efficient non-adaptive long code test with perfect completeness (Q3192387) (← links)
- A Query Efficient Non-adaptive Long Code Test with Perfect Completeness (Q3588448) (← links)
- On the Boolean Connectivity Problem for Horn Relations (Q3612466) (← links)
- Beating Brute Force for Systems of Polynomial Equations over Finite Fields (Q4575891) (← links)
- (Q4608607) (← links)
- (Q4608645) (← links)
- Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues (Q4629958) (← links)
- (Q4785576) (← links)
- An Exact Algorithm for the Boolean Connectivity Problem for k-CNF (Q4930587) (← links)
- Parallel Repetition of Two-Prover One-Round Games: An Exposition (Q5135260) (← links)
- (Q5363763) (← links)
- (Q5501274) (← links)