13th International Workshop on Boolean Problems

Program


University of Bremen | MZH 1090

Wednesday | September 19


17:00 - 18:00 Registration and Welcome reception

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

16:30 - 22:00 | Social Event

Friday | September 21


08:30 - 10:00 | Session 4

New Results on Reversible Boolean Functions Having Component Functions with Specified Properties
Pawel Kerntopf, Krzysztof Podlaski, Claudio Moraga and Radomir Stanković

XOR-Based Synthesis: Does it Pay off?
Ivo Háleček, Petr Fišer and Jan Schmidt

Exact Synthesis of ESOP Forms
Heinz Riener, Rüdiger Ehlers, Bruno De O. Schmitt and Giovanni De Micheli

10:00 - 10:30 | Coffee break

10:30 - 12:00 | Session 5

Efficient Hardware Realization of Arithmetic Operations for the Residue Number System by Boolean Minimization
Danila Gorodecky and Tiziano Villa

Literal Selection in Switching Lattice Design
Anna Bernasconi, Fabrizio Luccio, Linda Pagli and Davide Rucci

Construction of 1-Resilient Boolean Functions with Good Nonlinearity by Spectral Invariant Operations
Milena Stanković, Suzana Stojković, Radomir Stanković and Claudio Moraga

12:00 - 13:15 | Lunch

13:15 - 14:00 | Keynote | Prof. Dr. Tim Güneysu

14:00 - 15:00 | Session 6

An Algorithm for Linear, Affine and Spectral Classification of Boolean Functions
D. Michael Miller and Mathias Soeken

Generation of Binary Bent Functions by Walsh Spectral Invariant Operations Performed in Reed-Muller Domain
Suzana Stojković, Milena Stanković, Claudio Moraga and Radomir Stanković