Thursday | September 20
08:00 - 08:30 Registration and Welcome
08:30 - 10:00 | Session 1
Derivative Operations for Classes CN of Boolean Functions
Bernd Steinbach and Christian Posthoff
Towards the Structure of a Class of Permutation Matrices Associated With Bent Functions
Radomir Stanković, Milena Stanković, Jaakko Astola and Claudio Moraga
Discovery of Bent Functions in Fixed Polarity Reed-Muller Domain Using Dual Polarity Route
Miloš Radmanović and Radomir Stanković
10:00 - 10:30 | Coffee break
10:30 - 12:00 | Session 2
A Complexity Analysis of the Cycles-based Synthesis of Ternary Reversible Circuits
Caroline Barbieri and Claudio Moraga
Reversible Functions in Walsh Hadamard Domain
Krzysztof Podlaski
Analysis of Quantum Circuits with Classical Boolean Logic
Martin Lukac and Bernd Steinbach
12:00 - 13:15 | Lunch
13:15 - 14:00 | Keynote | Prof. Dr. Görschwin Fey
14:00 - 14:30 | Coffee break
14:30 - 16:00 | Session 3
ConfidenceSAT: A Parallel SAT Solver with Conflict Clause Handling
Kenneth Schmitz, Oliver Keszocze, Jil Tietjen and Rolf Drechsler
Synthesis of Majority Expressions through Primitive Function Manipulation
Evandro C. Ferraz, Jeferson de Lima Muniz, Alexandre C. R. da Silva and Gerhard Dueck
Improving SAT solving using Monte Carlo Tree Search-based Clause Learning
Oliver Keszocze, Kenneth Schmitz, Jens Schloeter and Rolf Drechsler