Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Tobias Friedrich 0001, Frank Neumann 0001, Ralf Rothenberger, Andrew M. Sutton. Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily. In Chu Min Li, Felip Manyà, editors, Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings. Volume 12831 of Lecture Notes in Computer Science, pages 188-206, Springer, 2021. [doi]

This author has not been identified. Look up 'Tobias Friedrich 0001' in GoogleThis author has not been identified. Look up 'Frank Neumann 0001' in GoogleThis author has not been identified. Look up 'Ralf Rothenberger' in GoogleThis author has not been identified. Look up 'Andrew M. Sutton' in Google

runs on WebDSL