Results 211 to 220 of about 153,244 (275)

Continuity of homomorphisms

Duke Mathematical Journal, 1961
openaire   +3 more sources

Unified framework for matchgate classical shadows. [PDF]

npj Quantum Inf
Heyraud V, Chomet H, Tilly J.
europepmc   +1 more source

On Morphisms Between Connected Commutative Algebraic Groups over a Field of Characteristic 0. [PDF]

Transform Groups
Dill GA.
europepmc   +1 more source

Approaches to embryonic neurodevelopment: from neural cell to neural tube formation through mathematical models. [PDF]

Brief Bioinform
Rafati AH, Joca S, Vontell RT, Wegener G, Ardalan M.   +4 more
europepmc   +1 more source

On the Converse of Pansu's Theorem. [PDF]

Arch Ration Mech Anal
De Philippis G, Marchese A, Merlo A, Pinamonti A, Rindler F.   +4 more
europepmc   +1 more source

Quantum game strategy solution for R&D cartel: Reorganizing government R&D investment strategy in Korea. [PDF]

PLoS One
Won D, Lim J, Lee B.
europepmc   +1 more source

A privacy-preserving expert system for collaborative medical diagnosis across multiple institutions using federated learning. [PDF]

Sci Rep
Markkandan S, Bhavani NPG, Nath SS.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Homomorphism Tensors and Linear Equations

International Colloquium on Automata, Languages and Programming, 2021
Lov\'asz (1967) showed that two graphs $G$ and $H$ are isomorphic if and only if they are homomorphism indistinguishable over the class of all graphs, i.e.
Martin Grohe, Gaurav Rattan, Tim Seppelt
semanticscholar   +1 more source

Graph Similarity and Homomorphism Densities

International Colloquium on Automata, Languages and Programming, 2021
We introduce the tree distance, a new distance measure on graphs. The tree distance can be computed in polynomial time with standard methods from convex optimization.
Jan Böker
semanticscholar   +1 more source

Full complexity classification of the list homomorphism problem for bounded-treewidth graphs

Embedded Systems and Applications, 2020
A homomorphism from a graph $G$ to a graph $H$ is an edge-preserving mapping from $V(G)$ to $V(H)$. Let $H$ be a fixed graph with possible loops. In the list homomorphism problem, denoted by LHom($H$), we are given a graph $G$, whose every vertex $v$ is ...
Karolina Okrasa, Marta Piecyk, Paweł Rzaͅżewski   +2 more
semanticscholar   +1 more source