OpenAlex
PricingAboutJobs
Log inGet started
Work

On selecting a satisfying truth assignment

HTML

Year: 2002
Type: conference-paper
Source: Annual Symposium on Foundations of Computer Science
DOI: 10.1109/sfcs.1991.185365
Author: C.H. Papadimitriou
Institution: University of California San Diego
Language: English

Topic: Advanced Graph Theory Research
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: satisfiability, minimality, circumscription, computational complexity, 2-SAT, randomized algorithms, polynomial-time algorithms

Open Access status: closed
OpenAlex ID: W1820801893
FWCI: 10.17
Cites: 12
Cited by: 295
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms