Methodological Bridges for Multi-Level Systems
- 作者Emanuela Merelli; Nicola Paoletti; Pietro Liò
- 卷第7卷
- 印刷ISSN1877-0509
- 文件大小111.48KB
- 发表时间2011
- DOI10.1016/j.procs.2011.09.065
- 页码180-182
On the Complexity of Certified Write-All AlgorithmsC. Martel; R. Subramonian · 1994
Sample Complexity of Device-Independently Certified “Quantum Supremacy”Hangleiter, Dominik; Kliesch, Martin; Eisert, Jens; Gogolin, Christian · Physical Review Letters · 2019
Professional Role Complexity and Job Satisfaction of Collegiate Certified Athletic TrainersBrumels, Kirk; Beach, Andrea · Journal of Athletic Training · 2008
Clinical and Anatomic Pathology Test Volume by Specialty and Subspecialty Among High-Complexity CLIA-Certified Laboratories in 2011Wians, F. H.; Gill, G. W. · Laboratory Medicine · 2013
[ACM Press the 7th ACM SIGPLAN International Conference - Los Angeles, CA, USA (2018.01.08-2018.01.09)] Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2018 - Formal proof of polynomial-time complexity with quasi-interpretationsFérée, Hugo; Hym, Samuel; Mayero, Micaela; Moyen, Jean-Yves; Nowak, David · 2018
[ACM Press the 7th ACM SIGPLAN International Conference - Los Angeles, CA, USA (2018.01.08-2018.01.09)] Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2018 - Formal proof of polynomial-time complexity with quasi-interpretationsFérée, Hugo; Hym, Samuel; Mayero, Micaela; Moyen, Jean-Yves; Nowak, David · 2018
[ACM Press the 7th ACM SIGPLAN International Conference - Los Angeles, CA, USA (2018.01.08-2018.01.09)] Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2018 - Efficient certification of complexity proofs: formalizing the Perron–Frobenius theorem (invited talk paper)Divasón, Jose; Joosten, Sebastiaan; Kunčar, Ondřej; Thiemann, René; Yamada, Akihisa · 2018