Mathias Soeken

From MaRDI portal
Revision as of 13:54, 6 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:491239

Available identifiers

zbMath Open soeken.mathiasDBLP20/3466WikidataQ102416100 ScholiaQ102416100MaRDI QIDQ491239

List of research outcomes





PublicationDate of PublicationType
An Algorithm for Linear, Affine and Spectral Classification of Boolean Functions2024-01-23Paper
Improved Quantum Circuits for Elliptic Curve Discrete Logarithms2022-10-13Paper
https://portal.mardi4nfdi.de/entity/Q50206322022-01-06Paper
https://portal.mardi4nfdi.de/entity/Q50206332022-01-06Paper
Boolean satisfiability in quantum compilation2021-06-15Paper
https://portal.mardi4nfdi.de/entity/Q51443742021-01-15Paper
Mapping Monotone Boolean Functions into Majority2019-08-13Paper
The complexity of error metrics2018-10-19Paper
Pairs of majority-decomposing functions2018-10-19Paper
Quantum circuits for floating-point arithmetic2018-10-17Paper
SAT-based {CNOT, \(T\)} quantum circuit synthesis2018-10-17Paper
Ricercar: A Language for Describing and Rewriting Reversible Circuits with Ancillae and Its Permutation Semantics2016-09-30Paper
Technology Mapping for Single Target Gate Based Circuits Using Boolean Functional Decomposition2016-09-30Paper
Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT2016-09-05Paper
Enumeration of Reversible Functions and Its Application to Circuit Complexity2016-08-10Paper
A Fast Symbolic Transformation Based Algorithm for Reversible Logic Synthesis2016-08-10Paper
Complexity of reversible circuits and their quantum implementations2016-02-18Paper
Property Checking of Quantum Circuits Using Quantum Multiple-Valued Decision Diagrams2015-11-30Paper
Using πDDs in the Design of Reversible Circuits2015-11-30Paper
Ancilla-free synthesis of large reversible functions using binary decision diagrams2015-08-24Paper
Translating between the roots of the identity in quantum computers2015-03-30Paper
Self-Inverse Functions and Palindromic Circuits2015-02-20Paper
Quantum Circuit Optimization by Hadamard Gate Reduction2014-09-02Paper
Mapping NCV Circuits to Optimized Clifford+T Circuits2014-09-02Paper
Upper bounds for reversible circuits based on Young subgroups2014-04-17Paper
White Dots do Matter: Rewriting Reversible Logic Circuits2013-12-17Paper
Reducing the Depth of Quantum Circuits Using Additional Circuit Lines2013-12-17Paper
Encoding OCL Data Types for SAT-Based Verification of UML/OCL Models2011-07-07Paper

Research outcomes over time

This page was built for person: Mathias Soeken