Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems
نویسندگان
چکیده
We present measures for bounding the instance-based complexity of AND/OR search algorithms for solution counting and related #P problems. To this end we estimate the size of the search space, with special consideration given to the impact of determinism in a problem. The resulting schemes are evaluated empirically on a variety of problem instances and shown to be quite powerful.
منابع مشابه
Randomness and Counting 6.1 Probabilistic Polynomial-time Construction 6.4 (the Reduction): on Input a Natural Number N > 2 Do
I owe this almost atrocious variety to an institution which other republics do not know or which operates in them in an imperfect and secret manner: the lottery. So far, our approach to computing devices was somewhat conservative: we thought of them as executing a deterministic rule. A more liberal and quite realistic approach , which is pursued in this chapter, considers computing devices that...
متن کاملAlgorithmic Lower Bounds : Fun With Hardness Proofs Fall 2014
We have seen many decision problems when we are concerned whether a solution exists. In ap proximation problems we had to define a stronger version of NP-style problems which are the optimization problem (NPO) when we want to find the best solution (that maximizes or minimizes some parameter). This class will cover counting problems and, as we did in the past, we will define another version of...
متن کاملArithmetic Circuits and Counting Complexity Classes
• Innovative work by Kabanets and Impagliazzo [KI03] shows that, in some cases, providing lower bounds on arithmetic circuit size can yield consequences about Boolean complexity classes. For instance, one of the most important problems in BPP that is not known to be in P is Arithmetic Circuit Identity Testing (ACIT), the problem of determining if two arithmetic circuits compute the same functio...
متن کاملSelf-reducible with easy decision version counting problems admit additive error approximation. Connections to counting complexity, exponential time complexity, and circuit lower bounds
We consider the class of counting problems,i.e. functions in #P, which are self reducible, and have easy decision version, i.e. for every input it is easy to decide if the value of the function f(x) is zero. For example, #independent-sets of all sizes, is such a problem, and one of the hardest of this class, since it is equivalent to #SAT under multiplicative approximation preserving reductions...
متن کاملOn the Effective Enumerability of NP Problems
In the field of computational optimization, it is often the case that we are given an instance of an NP problem and asked to enumerate the first few ”best” solutions to the instance. Motivated by the recent research performed in these fields, we propose in this paper a new framework to measure the effective enumerability of NP optimization problems. More specifically, given an instance of an NP...
متن کامل