OpenAlex
PricingAboutJobs
Log inGet started
Work

A Note on Approximate Counting for k-DNF

HTML

Year: 2004
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA, August 22-24, 2004. Proceedings
DOI: 10.1007/978-3-540-27821-4_37
Author: Luca Trevisan
Institution: University of California, Berkeley
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: approximate counting, k-CNF, satisfiability counting, k-SAT, derandomization

Open Access status: closed
OpenAlex ID: W1582008706
FWCI: 0.943
Cites: 13
Cited by: 47
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
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security