Partial words and a theorem of Fine and Wilf
Theoretical Computer Science
Bounds for the String Editing Problem
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Automatic Sequences: Theory, Applications, Generalizations
Automatic Sequences: Theory, Applications, Generalizations
A determinant-based algorithm for counting perfect matchings in a general graph
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
Journal of the ACM (JACM)
Testing primitivity on partial words
Discrete Applied Mathematics
Pseudorandomness for Approximate Counting and Sampling
Computational Complexity
Theoretical Computer Science
Algorithmic Combinatorics on Partial Words (Discrete Mathematics and Its Applications)
Algorithmic Combinatorics on Partial Words (Discrete Mathematics and Its Applications)
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings
Algorithmica - Parameterized and Exact Algorithms
An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Computational Complexity: A Modern Approach
Computational Complexity: A Modern Approach
Counting distinct squares in partial words
Acta Cybernetica
Combinatorial queries and updates on partial words
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Periodicity algorithms for partial words
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Binary de bruijn partial words with one hole
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Hard counting problems for partial words
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Hi-index | 0.00 |
We present several problems regarding counting full words compatible with a set of partial words or with the factors of a partial word, and show that they are #P-complete. Some of these counting problems have NP-complete decision counterparts to which a hard variant of CNF-SAT is reduced parsimoniously; the rest are #P-complete problems that cannot be canonically associated to NP-complete decision problems. For these problems we assume that the set of symbols compatible with the wildcards equals the alphabet of the input partial word. When both a partial word and the cardinality of the alphabet compatible with the wildcard are given as input, we show that the central problem of counting the full words compatible with factors of the given partial word is also #P-complete. Finally, we propose a nontrivial exponential-time algorithm, working in polynomial space, useful to derive upper bounds for the time needed to solve the discussed problems.