Skip to main navigation
Skip to search
Skip to main content
Ariel University Home
Help & FAQ
Link opens in a new tab
English
עברית
العربية
Search content at Ariel University
Home
Profiles
Research units
Equipment
Research output
Prizes
Activities
Press/Media
SAT local search algorithms: worst-case study
Edward A. Hirsch
Research output
:
Contribution to journal
›
Article
›
peer-review
20
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'SAT local search algorithms: worst-case study'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Local Search
100%
Search Algorithm
100%
Worst Case
100%
Lower and upper bounds
66%
Upper Bound
33%
Keyphrases
Local Search Algorithm
100%
NP-complete
33%
Poor Performance
33%
Linear Size
33%
Boolean Formulas
33%
DIMACS
33%
Satisfiability Problem
33%
Worst-case Behavior
33%
Good Performance
33%
SAT Algorithm
33%
Computer Science
Case Study
100%
Local Search Algorithm
100%
Good Performance
33%
Theoretical Knowledge
33%
Satisfying Assignment
33%
Boolean Formula
33%
Satisfiability Problem
33%