Skip to main navigation
Skip to search
Skip to main content
Tel Aviv University Home
Update Request & User Guide (TAU staff only)
Home
Experts
Research units
Research output
Datasets
Prizes
Activities
Press/Media
Search by expertise, name or affiliation
Finding almost-satisfying assignments
Uri Zwick
*
*
Corresponding author for this work
School of Computer Science
Research output
:
Contribution to journal
›
Conference article
›
peer-review
36
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Finding almost-satisfying assignments'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Polynomial Time
100%
2-SAT
100%
Three-class
50%
Boolean Formulas
50%
Constraint Satisfaction Problem
50%
Boolean Constraints
50%
Computer Science
Polynomial Time
100%
Satisfying Assignment
100%
Boolean Formula
50%
Constraint Satisfaction Problems
50%
Boolean Constraint
50%
Mathematics
Polynomial Time
100%