Homomorphic Hashing for Sparse Coefficient Extraction

  • Petteri Kaski
  • Mikko Koivisto
  • Jesper Nederlof
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7535)

Abstract

We study classes of Dynamic Programming (DP) algorithms which, due to their algebraic definitions, are closely related to coefficient extraction methods. DP algorithms can easily be modified to exploit sparseness in the DP table through memorization. Coefficient extraction techniques on the other hand are both space-efficient and parallelisable, but no tools have been available to exploit sparseness. We investigate the systematic use of homomorphic hash functions to combine the best of these methods and obtain improved space-efficient algorithms for problems including LINEAR SAT, SET PARTITION and SUBSET SUM. Our algorithms run in time proportional to the number of nonzero entries of the last segment of the DP table, which presents a strict improvement over sparse DP. The last property also gives an improved algorithm for CNF SAT and SET COVER with sparse projections.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alon, N., Gutin, G., Kim, E.J., Szeider, S., Yeo, A.: Solving MAX-r-SAT above a tight lower bound. Algorithmica 61(3), 638–655 (2011)MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    Björklund, A.: Determinant sums for undirected Hamiltonicity. In: FOCS, pp. 173–182. IEEE Computer Society (2010)Google Scholar
  3. 3.
    Björklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion-exclusion. SIAM J. Comput. 39(2), 546–563 (2009)MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    Crowston, R., Gutin, G., Jones, M., Yeo, A.: Lower bound for Max-r-Lin2 and its applications in algorithmics and graph theory. CoRR, abs/1104.1135 (2011)Google Scholar
  5. 5.
    Eppstein, D., Galil, Z., Giancarlo, R., Italiano, G.F.: Sparse dynamic programming I: linear cost functions. J. ACM 39, 519–545 (1992)MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
    Eppstein, D., Galil, Z., Giancarlo, R., Italiano, G.F.: Sparse dynamic programming II: convex and concave cost functions. J. ACM 39(3), 546–567 (1992)MathSciNetMATHCrossRefGoogle Scholar
  7. 7.
    Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms, 1st edn. Springer-Verlag New York, Inc., New York (2010)MATHCrossRefGoogle Scholar
  8. 8.
    Gaspers, S., Szeider, S.: Strong backdoors to nested satisfiability. CoRR, abs/1202.4331 (2012)Google Scholar
  9. 9.
    Harnik, D., Naor, M.: On the compressibility of NP instances and cryptographic applications. SIAM Journal on Computing 39(5), 1667–1713 (2010)MathSciNetMATHCrossRefGoogle Scholar
  10. 10.
    Håstad, J.: Some optimal inapproximability results. J. ACM 48, 798–859 (2001)MathSciNetMATHCrossRefGoogle Scholar
  11. 11.
    Horowitz, E., Sahni, S.: Computing partitions with applications to the knapsack problem. J. ACM 21, 277–292 (1974)MathSciNetMATHCrossRefGoogle Scholar
  12. 12.
    Impagliazzo, R., Paturi, R.: On the complexity of k-SAT. J. Comput. Syst. Sci. 62(2), 367–375 (2001)MathSciNetMATHCrossRefGoogle Scholar
  13. 13.
    Koutis, I., Williams, R.: Limits and Applications of Group Algebras for Parameterized Problems. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 653–664. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  14. 14.
  15. 15.
    Lokshtanov, D., Nederlof, J.: Saving space by algebraization. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, pp. 321–330. ACM, New York (2010)CrossRefGoogle Scholar
  16. 16.
    Mansour, Y.: Randomized interpolation and approximation of sparse polynomials. SIAM J. Comput. 24(2), 357–368 (1995)MathSciNetMATHCrossRefGoogle Scholar
  17. 17.
    Nederlof, J.: Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 713–725. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  18. 18.
    Nishimura, N., Ragde, P., Szeider, S.: Solving #sat using vertex covers. Acta Inf. 44(7), 509–523 (2007)MathSciNetMATHCrossRefGoogle Scholar
  19. 19.
    Reed, B.A., Smith, K., Vetta, A.: Finding odd cycle transversals. Oper. Res. Lett. 32(4), 299–301 (2004)MathSciNetMATHCrossRefGoogle Scholar
  20. 20.
    Rosser, B.: Explicit bounds for some functions of prime numbers. American Journal of Mathematics 63(1), 211–232 (1941)MathSciNetCrossRefGoogle Scholar
  21. 21.
    Schroeppel, R., Shamir, A.: A T = O(2n/2), S = O(2n/4) algorithm for certain NP-complete problems. SIAM J. Comput. 10(3), 456–464 (1981)MathSciNetMATHCrossRefGoogle Scholar
  22. 22.
    Solomon, L.: The burnside algebra of a finite group. Journal of Combinatorial Theory 2(4), 603–615 (1967)MATHCrossRefGoogle Scholar
  23. 23.
    Traxler, P.: Exponential Time Complexity of SAT and Related Problems. PhD thesis, ETH Zürich (2010)Google Scholar
  24. 24.
    Williams, R.: Finding paths of length k in \(\mathcal{O}^\star(2^{k})\) time. Inf. Process. Lett. 109(6), 315–318 (2009)MATHCrossRefGoogle Scholar
  25. 25.
    Williams, R., Gomes, C.P., Selman, B.: Backdoors to typical case complexity. In: IJCAI, pp. 1173–1178. Morgan Kaufmann (2003)Google Scholar
  26. 26.
    Woeginger, G.J.: Open problems around exact algorithms. Discrete Applied Mathematics 156(3), 397–405 (2008)MathSciNetMATHCrossRefGoogle Scholar
  27. 27.
    Zippel, R.: Probabilistic Algorithms for Sparse Polynomials. In: Ng, E.W. (ed.) EUROSAM 1979 and ISSAC 1979. LNCS, vol. 72, pp. 216–226. Springer, Heidelberg (1979)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Petteri Kaski
    • 1
  • Mikko Koivisto
    • 2
  • Jesper Nederlof
    • 3
  1. 1.Helsinki Institute for Information Technology HIIT, Department of Information and Computer ScienceAalto UniversityFinland
  2. 2.Helsinki Institute for Information Technology HIIT, Department of Computer ScienceUniversity of HelsinkiFinland
  3. 3.Utrecht UniversityUtrechtThe Netherlands

Personalised recommendations