scholarly journals The quantum complexity of set membership

Author(s):  
J. Radhakrishnan ◽  
P. Sen ◽  
S. Venkatesh
Algorithmica ◽  
2002 ◽  
Vol 34 (4) ◽  
pp. 462-479 ◽  
Author(s):  
Not Available Not Available ◽  
Not Available Not Available ◽  
Not Available Not Available

2016 ◽  
Vol 26 (4) ◽  
pp. 803-813 ◽  
Author(s):  
Carine Jauberthie ◽  
Louise Travé-MassuyèEs ◽  
Nathalie Verdière

Abstract Identifiability guarantees that the mathematical model of a dynamic system is well defined in the sense that it maps unambiguously its parameters to the output trajectories. This paper casts identifiability in a set-membership (SM) framework and relates recently introduced properties, namely, SM-identifiability, μ-SM-identifiability, and ε-SM-identifiability, to the properties of parameter estimation problems. Soundness and ε-consistency are proposed to characterize these problems and the solution returned by the algorithm used to solve them. This paper also contributes by carefully motivating and comparing SM-identifiability, μ-SM-identifiability and ε-SM-identifiability with related properties found in the literature, and by providing a method based on differential algebra to check these properties.


2021 ◽  
Vol 64 (3) ◽  
pp. 15-17
Author(s):  
Don Monroe

A theorem about computations that exploit quantum mechanics challenges longstanding ideas in mathematics and physics.


Author(s):  
Zhiguo Wang ◽  
Xiaojing Shen ◽  
Haiqi Liu ◽  
Fanqin Meng ◽  
Yunmin Zhu

2020 ◽  
Vol 53 (2) ◽  
pp. 7446-7451
Author(s):  
Sara Ifqir ◽  
Vicenç Puig ◽  
Dalil Ichalal ◽  
Naima Ait-Oufroukh ◽  
Saïd Mammar

2021 ◽  
Vol 103 (10) ◽  
Author(s):  
Roberto Auzzi ◽  
Stefano Baiguera ◽  
G. Bruno De Luca ◽  
Andrea Legramandi ◽  
Giuseppe Nardelli ◽  
...  
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document