Record link: 
http://hdl.handle.net/20.500.12708/230483
https://doi.org/10.34727/2026/isbn.978-3-85448-093-8_21
-
Title: 
Optimising Constant Matrix Multiplication Circuits is NP-complete
en
Citation: 
Fiege, N., & Lange, M. (2026). Optimising Constant Matrix Multiplication Circuits is NP-complete. In B. Dutertre & B. Könighofer (Eds.), Proceedings of the 26th Conference on Formal Methods in Computer-Aided Design – FMCAD 2026 (pp. 155–160). TU Wien Academic Press. https://doi.org/10.34727/2026/isbn.978-3-85448-093-8_21
-
reposiTUm DOI: 
10.34727/2026/isbn.978-3-85448-093-8_21
-
Publication Type: 
Inproceedings - Full-Paper Contribution
en
Language: 
English
-
Authors: 
Fiege, Nicolai 
Lange, Martin 
-
Editors: 
Dutertre, Bruno 
Könighofer, Bettina 
-
Organisational Unit: 
E000 - Technische Universität Wien 
-
Series: 
Conference Series: Formal Methods in Computer-Aided Design 
-
Published in: 
Proceedings of the 26th Conference on Formal Methods in Computer-Aided Design – FMCAD 2026 
-
Date (published): 
Sep-2026
-
Number of Pages: 
6
-
Publisher: 
TU Wien Academic Press
-
Peer reviewed: 
Yes
-
Keywords: 
formal methods; computer-aided system design; hardware and system verification
en
Research Areas: 
Logic and Computation: 40%
Computer Engineering and Software-Intensive Systems: 40%
Computer Science Foundations: 20%
-
Science Branch: 
1020 - Informatik: 100%
-
License: 
CC BY 4.0 CC BY 4.0
en
Appears in Collections:
Open Access Series

Thumbnail
Fulltext (Version of Record (published version))
Adobe PDF
(305 kB)
Open Access CC BY 4.0
Show full item record

Google ScholarTM

Check