The NP-completeness column
From MaRDI portal
Publication:4962718
DOI10.1145/1077464.1077476zbMath1442.68065OpenAlexW2077803317MaRDI QIDQ4962718
No author found.
Publication date: 5 November 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1077464.1077476
Related Items (12)
Efficient implementations of Gaussian elimination in finite fields on ASICs for MQ cryptographic systems ⋮ Computational complexity of the landscape. I. ⋮ Distributed discovery of frequent subgraphs of a network using MapReduce ⋮ Finding a shortest even hole in polynomial time ⋮ A time-based solution for the graph isomorphism problem ⋮ On the embedding of cone graphs in the line with distinct distances between neighbors ⋮ A computational comparison of symmetry handling methods for mixed integer programs ⋮ The number of steps for construction of a Boolean solution to polynomial congruences and systems of polynomial congruences ⋮ On families of categorial grammars of bounded value, their learnability and related complexity questions ⋮ Polynomial equivalence of the problems ``predicate formulas isomorphism and graph isomorphism ⋮ Unnamed Item ⋮ A faster algorithm to recognize even-hole-free graphs
This page was built for publication: The NP-completeness column
