HomeReferencesFeige2002Random3SAT

Feige2002Random3SAT

Relations between average case complexity and approximation complexity

Uriel Feige

misc2002
Citation key
Feige2002Random3SAT
Year
2002
Cited by
1 catalog records
Direct source
Available

Why this source is in the ledger

Proceedings of the 34th Annual ACM Symposium on Theory of Computing, 534–543.

Conjectures citing this source

Bibliographic fields

Inspect the parsed BibTeX fields
author
Uriel Feige
doi
10.1145/509907.509985
note
Proceedings of the 34th Annual ACM Symposium on Theory of Computing, 534--543.
title
Relations between average case complexity and approximation complexity
year
2002