scholarly journals On the computational complexity of the secure state-reconstruction problem

Automatica ◽  
2022 ◽  
Vol 136 ◽  
pp. 110083
Author(s):  
Yanwen Mao ◽  
Aritra Mitra ◽  
Shreyas Sundaram ◽  
Paulo Tabuada
Keyword(s):  
Computational Complexity ◽  
Reconstruction Problem ◽  
State Reconstruction

Multiple coincidences and the quantum state reconstruction problem

1997 ◽  
Vol 56 (5) ◽  
pp. 4076-4085 ◽  
Author(s):  
H. Paul ◽  
P. Törmä ◽  
T. Kiss ◽  
I. Jex
Keyword(s):  
Quantum State ◽  
Reconstruction Problem ◽  
State Reconstruction ◽  
Quantum State Reconstruction

Bipolar Abstract Argumentation with Dual Attacks and Supports

2020 ◽  
Author(s):  
Nico Potyka
Keyword(s):  
Computational Complexity ◽  
Decision Problems ◽  
Abstract Argumentation ◽  
Stable Semantics ◽  
Support Relations ◽  
Support Relationships ◽  
Computational Properties ◽  
Inherent Tendency

Bipolar abstract argumentation frameworks allow modeling decision problems by defining pro and contra arguments and their relationships. In some popular bipolar frameworks, there is an inherent tendency to favor either attack or support relationships. However, for some applications, it seems sensible to treat attack and support equally. Roughly speaking, turning an attack edge into a support edge, should just invert its meaning. We look at a recently introduced bipolar argumentation semantics and two novel alternatives and discuss their semantical and computational properties. Interestingly, the two novel semantics correspond to stable semantics if no support relations are present and maintain the computational complexity of stable semantics in general bipolar frameworks.

Sign in / Sign up

Export Citation Format

Share Document