On the hardness of counting problems of complete mappings.

DOI10.1016/S0012-365X(03)00176-6zbMath1069.68050OpenAlexW1981139508MaRDI QIDQ1426113

D. Frank Hsu, Yuh-Pyng Shieh, Jieh Hsiang

Publication date: 14 March 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00176-6

zbMATH Keywords

Counting problemComplete mapping\#P-completeness\(n\)-Queen problem

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (4)

Planar polynomials for commutative semifields with specified nuclei ⋮ A survey of known results and research areas for \(n\)-queens ⋮ Estimating the number of good permutations by a modified fast simulation method ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Generalized complete mappings, neofields, sequenceable groups and block designs. II
• Cyclic neofields and combinatorial designs
• Orthogonal starters in finite abelian groups
• Latin squares and superqueens
• On Methods of Constructing Sets of Mutually Orthogonal Latin Squares Using a Computer. I
• Orthomorphisms of Groups and Orthogonal Latin Squares. I
• #P-COMPLETENESS VIA MANY-ONE REDUCTIONS
• The n-Queens Problem
• The Construction of Orthogonal Latin Squares
• Complete mappings of finite groups

This page was built for publication: On the hardness of counting problems of complete mappings.