Homomorphic Hashing for Sparse Coefficient Extraction

@article{Kaski2012HomomorphicHF,
  title={Homomorphic Hashing for Sparse Coefficient Extraction},
  author={Petteri Kaski and Mikko Koivisto and Jesper Nederlof},
  journal={ArXiv},
  year={2012},
  volume={abs/1203.4063}
}
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… 

Space-Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm

The strategy for dealing with arbitrary instances is to instead inject the randomness into the dissection process itself by working over a carefully selected but random composite modulus, and to introduce explicit space---time controls into the algorithm by means of a "bailout mechanism".

Faster space-efficient algorithms for subset sum and k-sum

We present randomized algorithms that solve Subset Sum and Knapsack instances with n items in O*(20.86n) time, where the O*(·) notation suppresses factors polynomial in the input size, and polynomial

The Power of Data Reduction : Kernels for Fundamental Graph Problems

The concept of kernelization, developed within the field of parameterized complexity theory, is used to give a mathematical analysis of the power of data reduction for dealing with fundamental NP-hard graph problems and it is proved that Treewidth and Pathwidth do not admit polynomial kernels parameterized by the vertex-deletion distance to a clique, unless thePolynomial hierarchy collapses.

Faster Space-Efficient Algorithms for Subset Sum, k-Sum and Related Problems

We present randomized algorithms that solve subset sum and knapsack instances with $n$ items in $O^*(2^{0.86n})$ time, where the $O^*(\cdot)$ notation suppresses factors polynomial in the input size,

Finding Large Set Covers Faster via the Representation Method

A Monte Carlo algorithm is given that determines the existence of a set cover of size $\sigma n$ in $O^*(2^{(1-\Omega(\sigma^4))n})$ time and outputs NO if $\chi(G) > s$ and YES with constant probability if $\ chi(G)\leq s-1$.

Model Counting for CNF Formulas of Bounded Modular Treewidth

It is shown that the number of satisfying assignments can be computed in polynomial time for CNF formulas whose incidence graphs have bounded modular treewidth, and the first one to harness this technique for #SAT.

Dense Subset Sum may be the hardest

A characterization in terms of the popular density parameter $n/\log_2 t$: if all instances of density at least $1.003$ admit a truly faster algorithm, then so does every instance, which goes against the current intuition that instances ofdensity 1 are the hardest, and therefore is a step toward answering the open question in the affirmative.

Solving #SAT and MAXSAT by Dynamic Programming

These algorithms extend all previous results for MaxSAT and #SAT achieved by dynamic programming along structural decompositions of the incidence graph of the input formula, as a proof of concept that warrants further research.

Solving MaxSAT and #SAT on Structured CNF Formulas

A structural parameter of CNF formulas is proposed and used to identify instances of weighted MaxSAT and #SAT that can be solved in polynomial time.

Reducing a Target Interval to a Few Exact Queries

A generic method to transform a ranged problem into an exact problem (i.e. A ranged problem for which l?=?u) is developed and has several intriguing applications in exact exponential algorithms and parameterized complexity.

References

SHOWING 1-10 OF 33 REFERENCES

LIMITS and Applications of Group Algebras for Parameterized Problems

A variation of the algebraic method based on 2k evaluations of the circuit over a suitable algebra can break the trivial upper bounds for the disjoint summation problem and is applied to problems in exact counting.

Saving space by algebraization

This paper gives the first pseudo-polynomial time, polynomial space algorithms for Subset Sum and Knapsack, and shows how the framework yields polynometric space exact algorithms for the classical Traveling Salesman, Weighted Set Cover and Weighted Steiner Tree problems as well.

Strong Backdoors to Nested Satisfiability

It is shown that, parameterized by the size of a smallest strong backdoor set to the base class of nested formulas, computing the number of satisfying assignments of any CNF formula is fixed-parameter tractable.

On the Compressibility of NP Instances and Cryptographic Applications

  • Danny HarnikM. Naor
  • Computer Science, Mathematics
    2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
  • 2006
The study of compression that preserves the solution to an instance of a problem rather than preserving the instance itself is initiated, and a new classification of NP is given with respect to compression, which forms a stratification of NP that is called the VC hierarchy.

Sparse dynamic programming II: convex and concave cost functions

Dynamic programming solutions to two recurrence equations, used to compute a sequence alignment from a set of matching fragments between two strings, and to predict RNA secondary structure, are

Solving #SAT using vertex covers

An exact algorithm for counting the models of propositional formulas in conjunctive normal form based on the detection of strong backdoor sets of bounded size is proposed, which gives rise to a new hardness index for formulas, the clustering-width.

Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems

The concept of branching walks is introduced and the Inclusion-Exclusion algorithm of Karp is extended for counting Hamiltonian paths and polynomial-space $\mathcal{O}^*(2^n)$ algorithms for several spanning tree and partition problems are obtained.

Determinant Sums for Undirected Hamiltonicity

  • Andreas Björklund
  • Computer Science, Mathematics
    2010 IEEE 51st Annual Symposium on Foundations of Computer Science
  • 2010
A Monte Carlo algorithm for Hamilton city detection in an $n$-vertex undirected graph running in $O*(1.657^{n})$ time is presented, which is the first super polynomial improvement on the worst case runtime for the problem since the O^*(2^n) bound established for TSP almost fifty years ago.

Probabilistic algorithms for sparse polynomials

This work has tried to demonstrate how sparse techniques can be used to increase the effectiveness of the modular algorithms of Brown and Collins and believes this work has finally laid to rest the bad zero problem.

Computing Partitions with Applications to the Knapsack Problem

A technique is developed which improves all of the dynamic programming methods by asquare root factor and can be incorporated into the more general 0-1 knapsack problem obtaining a square root improvement in the asymptotic behavior.