(Nondeterministic) Hardness vs. Non-malleability.
Marshall BallDana Dachman-SoledJulian LossPublished in: CRYPTO (1) (2022)
Keyphrases
- finite state
- phase transition
- np complete
- computational complexity
- np hardness
- finite automata
- learning theory
- information theoretic
- worst case
- np hard
- data sets
- markov chain
- information systems
- initial state
- multi agent systems
- state space
- case study
- web services
- decision making
- computer vision
- machine learning
- neural network
- databases