( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
From DQBF to QBF by Dependency Elimination.

, , , , и . MBMV, Universität Tübingen, (2018)

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.

Bernd Becker

Bernd Becker

Bernd Becker

Bernd Becker

Bernd Becker

 

Другие публикации лиц с тем же именем

Learning Heuristics by Evolutionary Algorithms with Variable Size Representation, , и . (20 July 1997)Position paper at the Workshop on Evolutionary Computation with Variable Size Representation at ICGA-97.Planung und Organisation der Planung in der öffentlichen Verwaltung. Verwaltungswissenschaftliche Fälle Kohlhammer, Stuttgart u.a., 1. Aufl издание, (1978)Everything You Always Wanted to Know About Generalization of Proof Obligations in PDR., , , , , и . CoRR, (2021)Strategy Synthesis for POMDPs in Robot Planning via Game-Based Abstractions., , , , , , и . IEEE Trans. Autom. Control., 66 (3): 1040-1054 (2021)The K*BMD: A Verification Data Structure., , и . IEEE Des. Test Comput., 14 (2): 51-59 (1997)Automating the Generation of Programs Maximizing the Repeatable Constant Switching Activity in Microprocessor Units via MaxSAT., , , , , и . IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 42 (11): 4270-4281 (ноября 2023)Everything You Always Wanted to Know About Generalization of Proof Obligations in PDR., , , , , и . IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 42 (4): 1351-1364 (апреля 2023)How many decomposition types do we need? decision diagrams., и . ED&TC, стр. 438-443. IEEE Computer Society, (1995)From DQBF to QBF by Dependency Elimination., , , , и . MBMV, Universität Tübingen, (2018)ICP and IC3 with Stronger Generalization., , , , , и . MBMV, стр. 1-12. VDE/IEEE, (2021)