OpenAlex
PricingAboutJobs
Log inGet started
Work

Algorithms for Sat and Upper Bounds on Their Complexity

HTML

Year: 2003
Type: article
Source: Journal of Mathematical Sciences
DOI: 10.1023/a:1025645221773
Authors: M. A. Vsemirnov, E. A. Hirsch, E. Ya. Dantsin, S. V. Ivanov
Institutions: St. Petersburg Department of Steklov Institute of Mathematics, Steklov Mathematical Institute
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: propositional satisfiability, worst-case complexity, derandomization, random walk algorithm, randomized algorithms

Open Access status: closed
OpenAlex ID: W190339048
FWCI: 3.005
Cites: 45
Cited by: 15
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