A randomized satisfiability procedure for arithmetic and uninterpreted function symbols.

DOI10.1007/B11829MaRDI QIDQ5900717zbMATH OpenOpenAlexFDO

Authors Sumit Gulwani, George C. Necula

Publication date 20 April 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b11829

Mathematics Subject Classification ID

Randomized algorithms (68W20)

Recommendations

• A randomized satisfiability procedure for arithmetic and uninterpreted function symbols
• Solving the satisfiability problem by using randomized approach
• scientific article; zbMATH DE number 2084740
• Probabilistic performance of a heurisic for the satisfiability problem
• An exact and a randomized approach for the satisfiability problem

Cited in

(2)

• A randomized satisfiability procedure for arithmetic and uninterpreted function symbols
• scientific article; zbMATH DE number 3894500 (Why is no real title available?)

This page was built for publication: A randomized satisfiability procedure for arithmetic and uninterpreted function symbols.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900717)