( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The QBFGallery 2014: The QBF Competition at the FLoC Olympic Games.

, , , , , и . J. Satisf. Boolean Model. Comput., 9 (1): 187-206 (2014)

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.

Marco Lonsing

Florian Klasovsky

Syntheseparameter-Reaktivitätsbeziehungen für neue Palladiumoxidkatalysatoren in feinchemischen Hydrierungen. TU Darmstadt, (2009)

Florian Franz

Realzeittest von Fahrzeugsoftware-Komponenten. TU München, (2009)

Florian Beißner

Funktionelle Bildgebung des vegetativen Nervensystems: neue Ansätze zur fMRT-Messung des menschlichen Hirnstamms. Uni Frankfurt Main, (2010)

Florian Exl

Einflussfaktoren auf die Bewertung der Hydrophobieeigenschaften von Isolierwerkstoffen. TU München, (2010)
 

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

Effective Pre-Silicon Verification of Processor Cores by Breaking the Bounds of Symbolic Quick Error Detection., , , , , , , , и . CoRR, (2021)QRATPre+: Effective QBF Preprocessing via Strong Redundancy Properties., и . SAT, том 11628 из Lecture Notes in Computer Science, стр. 203-210. Springer, (2019)A-QED Verification of Hardware Accelerators., , , , , , , , , и 3 other автор(ы). DAC, стр. 1-6. IEEE, (2020)Unlocking the Power of Formal Hardware Verification with CoSA and Symbolic QED: Invited Paper., , , , , , , , и . ICCAD, стр. 1-8. ACM, (2019)G-QED: Generalized QED Pre-silicon Verification beyond Non-Interfering Hardware Accelerators., , , , , , , , , и 2 other автор(ы). DAC, стр. 1-6. IEEE, (2023)Integrating Dependency Schemes in Search-Based QBF Solvers., и . SAT, том 6175 из Lecture Notes in Computer Science, стр. 158-171. Springer, (2010)A Compact Representation for Syntactic Dependencies in QBFs., и . SAT, том 5584 из Lecture Notes in Computer Science, стр. 398-411. Springer, (2009)Lightweight Online Learning for Sets of Related Problems in Automated Reasoning., , , , , и . FMCAD, стр. 1-11. IEEE, (2023)DepQBF: A Dependency-Aware QBF Solver., и . J. Satisf. Boolean Model. Comput., 7 (2-3): 71-76 (2010)Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations., , , , , и . Formal Methods Syst. Des., 57 (2): 157-177 (2021)