~
/
t
/
group theory
⌘ '
raccourcis clavier
Search
group theory
Étiquette
math
publié à
26 févr. 2024
modifié à
03 nov. 2024
durée
1 min de lecture
source
llms.txt
Graph isomorphism
Vous pourriez aimer ce qui suit
Software Requirements and Security Considerations
Jax
SGD, ODEs
LLMs
Misra-Gries heavy-hitters algorithm
Monetary
Floating points error, Taylor series, and approximation
Liens retour
Graphs
See also slides Node as information and edges as relationship between data Directed acyclic graph (DAG) Application: Merkle DAG undirected. (\mathcal{N}, \mathcal{E}) \mathcal{N}: set of vertices \mathcal{E}: set of undirected edges: \mathcal{E} \subseteq \mathcal{N} \times \mathcal{N} path is a sequence of nodes and edges connect two nodes.