Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT.

M. Soeken, A. Mishchenko, A. Petkovska, B. Sterin, P. Ienne, R. Brayton, and G. Micheli. SAT, volume 9710 of Lecture Notes in Computer Science, page 212-227. Springer, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Univ. -Prof. Dr. Mathias Liewald University of Stuttgart

Mathias Weiser University of Stuttgart

Mathias Feinler University of Stuttgart

Mathias Jung University of Stuttgart

Univ. -Prof. Ph. D. Mathias Niepert University of Stuttgart

Other publications of authors with the same name

Upper bounds for reversible circuits based on Young subgroups.N. Abdessaied, M. Soeken, M. Thomsen, and R. Drechsler. Inf. Process. Lett., 114 (6): 282-286 (2014)The complexity of error metrics.O. Keszöcze, M. Soeken, and R. Drechsler. Inf. Process. Lett., (2018)Pairs of majority-decomposing functions.M. Soeken, E. Testa, A. Mishchenko, and G. Micheli. Inf. Process. Lett., (2018)Logic Synthesis for Established and Emerging Computing.E. Testa, M. Soeken, L. Amarù, and G. Micheli. Proceedings of the IEEE, 107 (1): 165-184 (2019)SAT-based CNOT, T Quantum Circuit Synthesis.G. Meuli, M. Soeken, and G. Micheli. RC, volume 11106 of Lecture Notes in Computer Science, page 175-188. Springer, (2018)Mapping NCV Circuits to Optimized Clifford+T Circuits.D. Miller, M. Soeken, and R. Drechsler. RC, volume 8507 of Lecture Notes in Computer Science, page 163-175. Springer, (2014)Technology Mapping for Single Target Gate Based Circuits Using Boolean Functional Decomposition.N. Abdessaied, M. Soeken, and R. Drechsler. RC, volume 9138 of Lecture Notes in Computer Science, page 219-232. Springer, (2015)Enumeration of Reversible Functions and Its Application to Circuit Complexity.M. Soeken, N. Abdessaied, and G. Micheli. RC, volume 9720 of Lecture Notes in Computer Science, page 255-270. Springer, (2016)Ancilla-free synthesis of large reversible functions using binary decision diagrams.M. Soeken, L. Tague, G. Dueck, and R. Drechsler. J. Symb. Comput., (2016)On-the-fly and DAG-aware: Rewriting Boolean Networks with Exact Synthesis.H. Riener, W. Haaswijk, A. Mishchenko, G. Micheli, and M. Soeken. DATE, page 1649-1654. IEEE, (2019)