Lower bounds for protrusion replacement by counting equivalence classes
From MaRDI portal
Publication:2174552
Recommendations
- Lower bounds for protrusion replacement by counting equivalence classes
- Lower bounds and the hardness of counting properties
- Lower bounds for the class number
- Number of bounded distance equivalence classes in hulls of repetitive Delone sets
- A lower bound for congruence representations
- Uniform lower bound for intersection numbers of \(\psi\)-classes
- Complexity classes of equivalence problems revisited
- Characterizations and approximability of hard counting classes below \#\textsf{P}
- On the succinct representation of equivalence classes
Cites work
- scientific article; zbMATH DE number 1323192 (Why is no real title available?)
- scientific article; zbMATH DE number 6783432 (Why is no real title available?)
- (Meta) kernelization
- Explicit linear kernels via dynamic programming
- Hitting forbidden minors: approximation and kernelization
- Kernelization using structural parameters on sparse graph classes
- Mixed searching and proper-path-width
- Parameterized algorithms
- Planar graphs, via well-orderly maps and trees
- Reduction algorithms for graphs of small treewidth
- Some simplified NP-complete graph problems
- The effect of planarization on width
- The effect of planarization on width
- Vertex cover structural parameterization revisited
Cited in
(3)
This page was built for publication: Lower bounds for protrusion replacement by counting equivalence classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2174552)
