Skip to main content
Article thumbnail
Location of Repository

Probabilistic Analysis of Satisfiability Algorithms

By John Franco

Abstract

Probabilistic and average-case analysis can give useful insight into the question of what algorithms for testing satisfiability might be effective and why. Under certain circumstances, one or more structural properties shared by each of a family or class of expressions may be exploited to solve such expressions efficiently

Year: 2008
OAI identifier: oai:CiteSeerX.psu:10.1.1.318.8303
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://gauss.ececs.uc.edu/fran... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.