The following pages link to Masaki Yamamoto (Q378220):
Displaying 19 items.
- Derandomizing the HSSW algorithm for 3-SAT (Q378221) (← links)
- Approximately counting paths and cycles in a graph (Q516844) (← links)
- On the Boolean connectivity problem for Horn relations (Q608293) (← links)
- An exact algorithm for the Boolean connectivity problem for \(k\)-CNF (Q638525) (← links)
- A polynomial-time perfect sampler for the \(Q\)-Ising with a vertex-independent noise (Q652623) (← links)
- An improved exact algorithm for the domatic number problem (Q845906) (← links)
- Average-case analysis for the MAX-2SAT problem (Q964385) (← links)
- A combinatorial analysis for the critical clause tree (Q1946495) (← links)
- Generating instances for MAX2SAT with optimal solutions (Q2509039) (← links)
- Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems (Q3143303) (← links)
- Compositional Synthesis of Leakage Resilient Programs (Q3304821) (← links)
- On the Boolean Connectivity Problem for Horn Relations (Q3612466) (← links)
- An Exact Algorithm for the Boolean Connectivity Problem for k-CNF (Q4930587) (← links)
- (Q5026974) (← links)
- An improved constant-time approximation algorithm for maximum~matchings (Q5172716) (← links)
- A Polynomial-Time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise (Q5323081) (← links)
- A Spectral Method for MAX2SAT in the Planted Solution Model (Q5387750) (← links)
- Average-Case Analysis for the MAX-2SAT Problem (Q5756558) (← links)
- Algorithms and Computation (Q5897897) (← links)
