Is Valiant-Vazirani's isolation probabilityimprovable?
Is Valiant-Vazirani's isolation probabilityimprovable?
复制标题
Valiant-Vazirani 的孤立概率是否可以提高?
DOI:
10.1007/s00037-013-0059-7
复制
发表时间:
2013
影响因子:
1.4
通讯作者:
Osamu Watanabe
中科院分区:
文献类型:
--
作者:
Holger Dell;Valentine Kabanets,Dieter van Melkebeek;Osamu Watanabe
The Isolation Lemma of Valiant and Vazirani (Theor Comput Sci 47:85–93, 1986) provides an efficient procedure forisolatinga satisfying assignment of a given satisfiable circuit: Given a Boolean circuitConninput variables, the procedure outputs a new circuitC′ on the sameninput variables such that (i) every satisfying assignment ofC′ also satisfiesCand (ii) ifCis satisfiable, thenC′ has exactly one satisfying assignment. In particular, ifCis unsatisfiable, then (i) implies thatC′ is unsatisfiable. The Valiant–Vazirani procedure israndomized, and whenCis satisfiable, it produces a uniquely satisfiable circuitC′ with probability Ω(1/n).Is it possible to have an efficientdeterministicwitness-isolating procedure? Or, at least, is it possible to improve the success probability of a randomized procedure to a large constant? We prove that there exists a non-uniform randomized polynomial-time witness-isolating procedure with success probability bigger than 2/3if and only ifNPP/poly. We establish similar results for other variants of witness isolation, such as reductions that remove all but an odd number of satisfying assignments of a satisfiable circuit.We also consider a blackbox setting of witness isolation that generalizes the setting of the Valiant–Vazirani Isolation Lemma and give an upper bound ofO(1/n) on the success probability for a natural class of randomized witness-isolating procedures.