Finding paths of length k in O∗(2k) time
Information Processing Letters
A Problem Kernelization for Graph Packing
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Improved Deterministic Algorithms for Weighted Matching and Packing Problems
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Limits and Applications of Group Algebras for Parameterized Problems
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
On the complexity of circuit satisfiability
Proceedings of the forty-second ACM symposium on Theory of computing
Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem
Journal of Computer and System Sciences
An improved kernelization algorithm for r-Set Packing
Information Processing Letters
Counting stars and other small subgraphs in sublinear time
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Finding and counting vertex-colored subtrees
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
An O*(3.533k)-time parameterized algorithm for the 3-set packing problem
Theoretical Computer Science
Improved deterministic algorithms for weighted matching and packing problems
Theoretical Computer Science
A polynomial algebra method for computing exemplar breakpoint distance
ISBRA'11 Proceedings of the 7th international conference on Bioinformatics research and applications
The complexity of testing monomials in multivariate polynomials
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Algorithms for testing monomials in multivariate polynomials
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Exact parameterized multilinear monomial counting via k-layer subset convolution and k-disjoint
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Matching and P2-packing: weighted versions
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Iterative Expansion and Color Coding: An Improved Algorithm for 3D-Matching
ACM Transactions on Algorithms (TALG)
Shortest cycle through specified elements
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On the parameterized complexity of the repetition free longest common subsequence problem
Information Processing Letters
Faster algorithms for finding and counting subgraphs
Journal of Computer and System Sciences
Parameterized complexity and subexponential-time computability
The Multivariate Algorithmic Revolution and Beyond
Constrained multilinear detection for faster functional motif discovery
Information Processing Letters
A fast parallel algorithm for minimum-cost small integral flows
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
Nearly exact mining of frequent trees in large networks
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part I
Journal of Combinatorial Optimization
Packing paths: Recycling saves time
Discrete Applied Mathematics
On testing monomials in multivariate polynomials
Theoretical Computer Science
Algebraic data retrieval algorithms for multi-channel wireless data broadcast
Theoretical Computer Science
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Finding the minimum-weight k-path
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Matching and Weighted P2-Packing: Algorithms and Kernels
Theoretical Computer Science
| Hi-index | 0.01 |
We study the problem of deciding whether an n-variate polynomial, presented as an arithmetic circuit G, contains a degree k square-free term with an odd coefficient. We show that if G can be evaluated over the integers modulo 2 k + 1 in time t and space s, the problem can be decided with constant probability in O((kn + t)2 k ) time and O(kn + s) space. Based on this, we present new and faster algorithms for two well studied problems: (i) an O *(2 mk ) algorithm for the m-set k-packing problem and (ii) an O *(23k/2) algorithm for the simple k-path problem, or an O *(2 k ) algorithm if the graph has an induced k-subgraph with an odd number of Hamiltonian paths. Our algorithms use poly(n) random bits, comparing to the 2 O(k) random bits required in prior algorithms, while having similar low space requirements.