<--- Back to Details
First PageDocument Content
3SUM / Computational geometry / NP-complete problems / Analysis of algorithms / Time complexity / Reduction / Algorithm / Boolean satisfiability problem / Complexity class / Theoretical computer science / Applied mathematics / Computational complexity theory
Date: 2004-12-20 06:07:32
3SUM
Computational geometry
NP-complete problems
Analysis of algorithms
Time complexity
Reduction
Algorithm
Boolean satisfiability problem
Complexity class
Theoretical computer science
Applied mathematics
Computational complexity theory

A Survey of 3sum-Hard Problems James King [removed]

Add to Reading List

Source URL: www.cs.mcgill.ca

Download Document from Source Website

File Size: 85,90 KB

Share Document on Facebook

Similar Documents

PDF Document

DocID: 1xSAp - View Document

PDF Document

DocID: 1xP7V - View Document

PDF Document

DocID: 1x8Vj - View Document

PDF Document

DocID: 1x2r1 - View Document

PDF Document

DocID: 1wHMX - View Document