Succinct Permanent is NEXP - hard with Many Hard Instances ∗ ( Extended
نویسنده
چکیده
A long standing issue in theoretical computer science is to find a problem that is both hard to solve and hard to solve on many instances. In this work we prove that the Succinct Permanent mod p is NEXP time hard in the worst case (via randomized polynomial time reduction). We find hard instance for any given heuritsic, either by running the heuristic applying the techniques in [3] toNEXP , or using auxilary provers to gain a more efficient procedure for finding a hard instance. We provide a technique for building an exponential set (in the number of additional bits added to the found instance) of hard instances of the problem.
منابع مشابه
Succinct Permanent Is NEXP-Hard with Many Hard Instances
Finding a problem that is both hard to solve and hard to solve on many instances is a long standing issue in theoretical computer science. In this work, we prove that the Succinct Permanent mod p is NEXP time hard in the worst case (via randomized polynomial time reduction). We find hard instances for any given heuristic, either by running the heuristic, applying the techniques in [5] to NEXP ,...
متن کاملApproximating Succinct MaxSat
We study the approximability of the version of MaxSat where exponentially large instances are succinctly represented using circuits. First, we prove that the NP-hardness for approximating MaxSat can be lifted to a corresponding NEXP-hardness for approximating circuitsuccinct MaxSat for some constant performance ratio. Second, we consider the approximability of circuit-succinct MaxSat with respe...
متن کاملHolographic Computation of Balanced Succinct Permanent Instances
Galperin and Wigderson proposed a succinct representation for graphs, that uses number of bits that is logarithmic in the number of nodes. They proved complexity results for various decision problems on graph properties, when the graph is given in a succinct representation. Later, Papadimitriou and Yannakakis showed, that under the same succinct encoding method, certain class of decision proble...
متن کاملStochastic Shortest Path with Energy Constraints in POMDPs: (Extended Abstract)
We consider partially observable Markov decision processes (POMDPs) with a set of target states and positive integer costs associated with every transition. The traditional optimization objective (stochastic shortest path) asks to minimize the expected total cost until the target set is reached. We extend the traditional framework of POMDPs to model energy consumption, which represents a hard c...
متن کاملExponential time reductions and sparse languages in NEXP
In this paper we define a many-one reduction which is allowed to work in exponential time but may only output polynomially many symbols. We show that there are no NEXP-hard sparse languages under our reduction unless EXP = UEXP.
متن کامل