Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
26
click to vote
FOCS
1997
IEEE
favorite
Email
discuss
report
81
views
Theoretical Computer Science
»
more
FOCS 1997
»
Satisfiability Coding Lemma
14 years 2 months ago
Download
people.cs.ubc.ca
Ramamohan Paturi, Pavel Pudlák, Francis Zan
Real-time Traffic
FOCS 1997
|
Theoretical Computer Science
|
claim paper
Related Content
»
On the Hamkins approximation property
»
The JohnsonLindenstrauss lemma almost characterizes Hilbert space but not quite
»
ListDecoding Using The XOR Lemma
»
Watermarking of SAT using Combinatorial Isolation Lemmas
»
Lemma Reusing for SAT based Planning and Scheduling
»
Pseudorandom generators without the XOR Lemma
»
A Parallel Architecture for Hermitian Decoders Satisfying Resource and Throughput Constrai...
»
A Supporting Tool to Identify both Satisfied Requirements and Tolerant Threats for a Java ...
»
Testing Whether a Set of Code Words Satisfies a Given Set of Constraints
more »
Post Info
More Details (n/a)
Added
25 Aug 2010
Updated
25 Aug 2010
Type
Conference
Year
1997
Where
FOCS
Authors
Ramamohan Paturi, Pavel Pudlák, Francis Zane
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision