Robustness against Power is PSpace-complete

DOI10.1007/978-3-662-43951-7_14zbMath1409.68069arXiv1404.7092OpenAlexW2248727051MaRDI QIDQ5167835

Roland Meyer, Egor Derevenetc

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.7092

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical problems of computer architecture (68M07) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (6)

Unnamed Item ⋮ Tackling Real-Life Relaxed Concurrency with FSL++ ⋮ Robustness Against Transactional Causal Consistency. ⋮ Checking robustness between weak transactional consistency models ⋮ Unnamed Item ⋮ CCA-Secure Keyed-Fully Homomorphic Encryption

This page was built for publication: Robustness against Power is PSpace-complete