Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT
From MaRDI portal
Publication:4930580
DOI10.1007/978-3-642-14186-7_8zbMath1306.68156OpenAlexW2151575947MaRDI QIDQ4930580
Carsten Fuhs, Peter Schneider-Kamp
Publication date: 29 September 2010
Published in: Theory and Applications of Satisfiability Testing – SAT 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14186-7_8
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Classical propositional logic (03B05)
Related Items
Logic minimization techniques with applications to cryptology, Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\), A new matrix form to generate all \(3\times 3\) involutory MDS matrices over \(\mathbb{F}_{2^m}\), Synchronous counting and computational algorithm design, Synthesizing quantum circuits of AES with lower \(T\)-depth and less qubits, Optimizing S-Box Implementations for Several Criteria Using SAT Solvers
Uses Software
