The computational complexity of Holant problems on 3-regular graphs.

Peng Yang Yuan Huang Zhiguo Fu

Published in: Theor. Comput. Sci. (2024)

Keyphrases

computational complexity
np complete
decision problems
problems involving
real time
np hard
neural network
high dimensional
special case
optimization problems
application domains
computational efficiency
graph theory
graph mining