OpenAlex
PricingAboutJobs
Log inGet started
Work

Satisfiability, branch-width and Tseitin tautologies

HTML

Year: 2003
Type: conference-paper
Source: Annual Symposium on Foundations of Computer Science
DOI: 10.1109/sfcs.2002.1181983
Authors: M. Alekhnovich, A.A. Razborov
Institutions: Massachusetts Institute of Technology, Institute for Advanced Study
Language: English

Topic: Advanced Graph Theory Research
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: satisfiability, branchwidth, treewidth, automated theorem proving, resolution refutation, satisfiability algorithms

Open Access status: closed
OpenAlex ID: W2139442450
FWCI: 3.637
Cites: 25
Cited by: 68
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
Security