Delegation with Updatable Unambiguous Proofs and PPAD-Hardness.
Yael Tauman KalaiOmer PanethLisa YangPublished in: CRYPTO (3) (2020)
Keyphrases
- conflict resolution
- access control
- computational complexity
- theorem proving
- access control systems
- theorem prover
- equational theories
- formal proofs
- np hard
- np hardness
- learning theory
- adjustable autonomy
- np complete
- information theoretic
- phase transition
- security policies
- computer programs
- natural deduction
- data sets
- worst case
- neural network
- artificial intelligence
- active rules
- social networks
- cross domain
- real time