Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

158

Voted

COCO
1994
Springer

108views Algorithms» more COCO 1994»

On the Query Complexity of Clique Size and Maximum Satisfiability

15 years 11 months ago

On the Query Complexity of Clique Size and Maximum Satisfiability

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

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)