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
29
click to vote
COCO
1994
Springer
favorite
Email
discuss
report
108
views
Algorithms
»
more
COCO 1994
»
On the Query Complexity of Clique Size and Maximum Satisfiability
14 years 3 months ago
Download
www.cs.umbc.edu
Richard Chang
Real-time Traffic
Algorithms
|
COCO 1994
|
claim paper
Related Content
»
Understanding the scalability of Bayesian network inference using clique tree growth curve...
»
Automated Design Debugging With Maximum Satisfiability
»
On Bounded Queries and Approximation
»
The complexity of maximum matroidgreedoid intersection and weighted greedoid maximization
»
XPath satisfiability in the presence of DTDs
»
Estimating Answer Sizes for XML Queries
»
Exploiting Problem Structure for Solution Counting
»
Building Data Synopses Within a Known Maximum Error Bound
»
Predecessor Queries in Dynamic Integer Sets
more »
Post Info
More Details (n/a)
Added
09 Aug 2010
Updated
09 Aug 2010
Type
Conference
Year
1994
Where
COCO
Authors
Richard Chang
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision