Sciweavers

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

63

Voted

CP
2008
Springer

favoriteEmaildiscussreport

73views Artificial Intelligence» more CP 2008»

Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems

15 years 21 days ago

Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems

Download www.ics.uci.edu

Lars Otten, Rina Dechter

Real-time Traffic

Artificial Intelligence | CP 2008 |

claim paper

Related Content

» Parity Problems in Planar Graphs

» The Complexity of Synchronous Iterative DoAll with Crashes

» Hardware Acceleration for Spatial Selections and Joins

» Exhaustive Search Combinatorial Optimization and Enumeration Exploring the Potential of Ra...

» Choiceless Computation and Symmetry

» AMMOS Automated Molecular Mechanics Optimization tool for in silico Screening

» A combinatorial optimization framework for subset selection in distributed multipleradar a...

Post Info
More Details (n/a)

Added	18 Oct 2010
Updated	18 Oct 2010
Type	Conference
Year	2008
Where	CP
Authors	Lars Otten, Rina Dechter

Comments (0)