Graph Normalization is a convergent dynamical system that approximates MWIS by always reaching a binary maximum independent set via majorization-minimization and evolutionary game equivalence.
freeman San Francisco
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
The authors present the first post-quantum secure end-to-end verifiable e-voting protocol whose security relies on the NP-hard multivariate quadratic (MQ) problem using standard cryptographic primitives.
citing papers explorer
-
Graph Normalization: Fast Binarizing Dynamics for Differentiable MWIS
Graph Normalization is a convergent dynamical system that approximates MWIS by always reaching a binary maximum independent set via majorization-minimization and evolutionary game equivalence.
-
A Post-Quantum Secure End-to-End Verifiable E-Voting Protocol Based on Multivariate Polynomials
The authors present the first post-quantum secure end-to-end verifiable e-voting protocol whose security relies on the NP-hard multivariate quadratic (MQ) problem using standard cryptographic primitives.