Abstract
Can sat be solved in “moderately exponential” time, i.e., in time p(|F|) 2cn for some polynomial p and some constant c < 1, where F is a CNF formula of size |F| over n variables? This challenging question is far from being resolved. In this paper, we relate the question of moderately exponential complexity of sat to the question of moderately exponential complexity of problems defined by existential second-order sentences. Namely, we extend the class SNP (Strict NP) that consists of Boolean queries defined by existential second-order sentences where the first-order part has a universal prefix. The extension is obtained by allowing a ∀ ... ∀ ∃ ... ∃ prefix in the first-order part. We prove that if sat can be solved in moderately exponential time then all problems in the extended class can also be solved in moderately exponential time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arvind, V., Schuler, R.: The quantum query complexity of 0-1 knapsack and associated claw problems. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol. 2906, pp. 168–177. Springer, Heidelberg (2003)
Calabro, C., Impagliazzo, R., Paturi, R.: A duality between clause width and clause density for SAT. In: Proceedings of the 21st Annual IEEE Conference on Computational Complexity, CCC 2006, pp. 252–260. IEEE Computer Society, Los Alamitos (2006)
Calabro, C., Impagliazzo, R., Paturi, R.: The complexity of satisfiability of small depth circuits. In: IWPEC 2009. LNCS, vol. 5917, pp. 75–85. Springer, Heidelberg (2009)
Calabro, C., Paturi, R.: k-SAT is no harder than Decision-Unique-k-SAT. In: Frid, A., Morozov, A., Rybalchenko, A., Wagner, K.W. (eds.) Computer Science - Theory and Applications. LNCS, vol. 5675, pp. 59–70. Springer, Heidelberg (2009)
Dantsin, E., Goerdt, A., Hirsch, E.A., Kannan, R., Kleinberg, J., Papadimitriou, C.H., Raghavan, P., Schöning, U.: A deterministic (2 − 2/(k + 1))n algorithm for k-SAT based on local search. Theoretical Computer Science 289(1), 69–83 (2002)
Dantsin, E., Hirsch, E.A.: Worst-case upper bounds. In: Handbook of Satisfiability, ch. 12, pp. 403–424. IOS Press, Amsterdam (2009)
Fagin, R.: Generalized first-order spectra and polynomial-time recognizable sets. In: Karp, R. (ed.) Complexity of Computation, SIAM–AMS Proceedings, vol. 7, pp. 27–41. AMS, Providence (1974)
Immerman, N.: Descriptive Complexity. Springer, Heidelberg (1999)
Impagliazzo, R., Paturi, R.: On the complexity of k-SAT. Journal of Computer and System Sciences 62(2), 367–375 (2001)
Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity. Journal of Computer and System Sciences 63(4), 512–530 (2001)
Kolaitis, P.G., Vardi, M.Y.: The decision problem for the probabilities of higher-order properties. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC 1987, pp. 425–435. ACM, New York (1987)
Marx, D.: Can you beat treewidth? In: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2007, pp. 169–179 (2007)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)
Paturi, R., Pudlák, P.: On the complexity of circuit satisfiability (2009), http://www.math.cas.cz/~pudlak/csat.pdf
Paturi, R., Pudlák, P., Saks, M.E., Zane, F.: An improved exponential-time algorithm for k-SAT. In: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, FOCS 1998, pp. 628–637 (1998)
Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation and complexity classes. Journal of Computer and System Sciences 43, 425–440 (1991)
Schöning, U.: A probabilistic algorithm for k-SAT and constraint satisfaction problems. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, FOCS 1999, pp. 410–414 (1999)
Traxler, P.: The time complexity of constraint satisfaction. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol. 5018, pp. 190–201. Springer, Heidelberg (2008)
Williams, R.: Algorithms and resource requirements for fundamental problems. PhD thesis, Carnegie-Melon University (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dantsin, E., Wolpert, A. (2010). On Moderately Exponential Time for SAT. In: Strichman, O., Szeider, S. (eds) Theory and Applications of Satisfiability Testing – SAT 2010. SAT 2010. Lecture Notes in Computer Science, vol 6175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14186-7_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-14186-7_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14185-0
Online ISBN: 978-3-642-14186-7
eBook Packages: Computer ScienceComputer Science (R0)