Skip to main navigation
Skip to search
Skip to main content
Ben-Gurion University Research Portal Home
Help & FAQ
Home
Profiles
Research output
Research units
Prizes
Press/Media
Student theses
Projects
Activities
Datasets
Research Labs / Equipment
Search by expertise, name or affiliation
GO-MOCE: Greedy Order Method of Conditional Expectations for Max Sat
Daniel Berend
, Shahar Golan
, Yochai Twitto
Department of Mathematics
Research output
:
Contribution to journal
›
Article
›
peer-review
1
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'GO-MOCE: Greedy Order Method of Conditional Expectations for Max Sat'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Computer Science
Case Time Complexity
100%
Comparative Evaluation
100%
Satisfiability Problem
100%
Unsatisfied Clause
100%
Benchmark Instance
100%
Keyphrases
Greedy
100%
Order Methods
100%
Method of Conditional Expectation
100%
Maximum Satisfiability
100%
Asymptotic Performance
16%
Time Complexity
8%
Algorithm Performance
8%
Random Instances
8%
Benchmark Instances
8%
Variable Ordering
8%
Maximum Satisfiability Problem
8%
Johnson's Algorithm
8%
Mathematics
Conditional Expectation
100%
Asymptotics
40%
Worst Case
20%