Results 251 to 260 of about 152,483 (296)
Transcendental Brauer-Manin obstructions on singular K3 surfaces. [PDF]
Res Number TheoryAlaa Tawfik M, Newton R.
europepmc +1 more source
Enhancing Efficiency in Trustless Cryptography: An Optimized SM9-Based Distributed Key Generation Scheme. [PDF]
Sensors (Basel)Chen J, Zhou X, Fu W, Mao Y.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Reversible Data Hiding in Shared Images Based on Syndrome Decoding and Homomorphism
IEEE Transactions on Cloud Computing, 2023Reversible Data Hiding in Encrypted Images (RDHEI) has drawn increasing concern in multimedia cloud computing scenarios. It embeds secret message into the encrypted carrier while preserving the confidentiality of the image.
Lizhi Xiong +3 more
semanticscholar +1 more source
Homomorphism Tensors and Linear Equations
International Colloquium on Automata, Languages and Programming, 2021Lov\'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, 2021We 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, 2020A 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 +2 more
semanticscholar +1 more source
Combinatorics, Probability and Computing, 2005
The dimension of a graph, that is the dimension of its incidence poset, became a major bridge between posets and graphs. Although allowing a nice characterization of planarity, this dimension badly behaves with respect to homomorphisms. We introduce the universal dimension of a graph G as the maximum dimension of a graph having a homomorphism to G. The
Ossona de Mendez, Patrice +1 more
openaire +4 more sources
The dimension of a graph, that is the dimension of its incidence poset, became a major bridge between posets and graphs. Although allowing a nice characterization of planarity, this dimension badly behaves with respect to homomorphisms. We introduce the universal dimension of a graph G as the maximum dimension of a graph having a homomorphism to G. The
Ossona de Mendez, Patrice +1 more
openaire +4 more sources
Fuzzy homomorphism theorems on rings
Journal of Discrete Mathematical Sciences and Cryptography, 2020In this paper, we introduce the notion of fuzzy kernel of a fuzzy homomorphism on rings and show that it is a fuzzy ideal of the domain ring. Conversely, we also prove that any fuzzy ideal of a ring is a fuzzy kernel of some fuzzy epimorphism, namely the
Gezahagne Mulat Addis +2 more
semanticscholar +1 more source
VAGUE ANTI HOMOMORPHISM OF A Γ-SEMIRINGS
, 2020In this paper, we introduce and study the concept of vague anti homomorphism of a Γ-semiring and we study the properties of anti homomorphic image and pre-image of a anti vague ideal of a Γ-semiring. Further we establish that the inverse image of an anti
Y. Bhargavi +3 more
semanticscholar +1 more source