The complexity of homomorphism reconstructibility
From MaRDI portal
Cites work
- Complexity classes defined by counting quantifiers
- Complexity of counting subgraphs: only the boundedness of the vertex-cover number counts
- Counting bounded tree depth homomorphisms
- Discrete density comonads and graph parameters
- Elementary Methods in Number Theory
- Homomorphism tensors and linear equations
- Homomorphisms are a good basis for counting small subgraphs
- scientific article; zbMATH DE number 3489128 (Why is no real title available?)
- scientific article; zbMATH DE number 3503283 (Why is no real title available?)
- scientific article; zbMATH DE number 3592969 (Why is no real title available?)
- scientific article; zbMATH DE number 487720 (Why is no real title available?)
- scientific article; zbMATH DE number 3189757 (Why is no real title available?)
- scientific article; zbMATH DE number 3082671 (Why is no real title available?)
- Large networks and graph limits
- Lasserre hierarchy for graph isomorphism and homomorphism indistinguishability
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Logical equivalences, homomorphism indistinguishability, and forbidden minors
- Lov\'asz Meets Weisfeiler and Leman
- On algorithms based on finitely many homomorphism counts
- On recognizing graphs by numbers of homomorphisms
- On the 3-local profiles of graphs
- On the Minimal Density of Triangles in Graphs
- On the representation of integers as sums of triangular numbers
- Parametrized complexity theory.
- Parity separation: a scientifically proven method for permanent weight loss
- PP is as Hard as the Polynomial-Time Hierarchy
- Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs
- Reflection positivity, rank connectivity, and homomorphism of graphs
- Semidefinite functions on categories
- Some observations on the connection between counting and recursion
- Some simplified NP-complete graph problems
- Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
- Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing
- The complexity of counting homomorphisms seen from the other side
- The homomorphism domination exponent
- Three \(\sum^ P_ 2\)-complete problems in computational learning theory
- Ulam's Conjecture and Graph Reconstructions
- Undecidability of linear inequalities in graph homomorphism densities
- Verallgemeinerungen des Waring-Hilbertschen Satzes.
This page was built for publication: The complexity of homomorphism reconstructibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902706)
