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
20
click to vote
COCOON
2008
Springer
favorite
Email
discuss
report
112
views
Combinatorics
»
more
COCOON 2008
»
Complexity of Counting the Optimal Solutions
13 years 9 months ago
Download
www.lix.polytechnique.fr
Miki Hermann, Reinhard Pichler
Real-time Traffic
COCOON 2008
|
Combinatorics
|
claim paper
Related Content
»
On the Complexity to Approach Optimum Solutions by Inhomogeneous Markov Chains
»
Construction of realistic gate sizing benchmarks with known optimal solutions
»
Power and area optimization by reorganizing CMOS complex gate circuits
»
Exploiting Problem Structure for Solution Counting
»
Counting Complexity of Propositional Abduction
»
Concurrent counting is harder than queuing
»
On Complexity of Optimal Recombination for Binary Representations of Solutions
»
How Hard is 3View Triangulation Really
»
The Complexity of Optimal Planning and a More Efficient Method for Finding Solutions
more »
Post Info
More Details (n/a)
Added
08 Nov 2010
Updated
08 Nov 2010
Type
Conference
Year
2008
Where
COCOON
Authors
Miki Hermann, Reinhard Pichler
Comments
(0)
Researcher Info
Combinatorics Study Group
Computer Vision