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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
1322
search results - page 20 / 265
»
Parameterized counting problems
Sort
relevance
views
votes
recent
update
View
thumb
title
103
click to vote
APPROX
2000
Springer
84
views
Algorithms
»
more
APPROX 2000
»
On the relative complexity of approximate counting problems
15 years 8 months ago
Download
web.maths.unsw.edu.au
Martin E. Dyer, Leslie Ann Goldberg, Catherine S. ...
claim paper
Read More »
110
Voted
CADE
1994
Springer
161
views
Logical Reasoning
»
more
CADE 1994
»
The Complexity of Counting Problems in Equational Matching
15 years 8 months ago
Download
www.lix.polytechnique.fr
Miki Hermann, Phokion G. Kolaitis
claim paper
Read More »
103
click to vote
CP
2008
Springer
73
views
Artificial Intelligence
»
more
CP 2008
»
Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems
15 years 5 months ago
Download
www.ics.uci.edu
Lars Otten, Rina Dechter
claim paper
Read More »
86
click to vote
SIAMCOMP
2008
70
views
more
SIAMCOMP 2008
»
Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems
15 years 3 months ago
Download
www.cs.rit.edu
Ivona Bezáková, Daniel Stefankovic, ...
claim paper
Read More »
91
Voted
CORR
1998
Springer
75
views
Education
»
more
CORR 1998
»
The Complexity of Planar Counting Problems
15 years 3 months ago
Download
perso.ens-lyon.fr
Harry B. Hunt III, Madhav V. Marathe, Venkatesh Ra...
claim paper
Read More »
« Prev
« First
page 20 / 265
Last »
Next »