From post

More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding.

, , и . CSR, том 7913 из Lecture Notes in Computer Science, стр. 378-390. Springer, (2013)

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.

 

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

SM-FPLF: Link-State Prediction for Software-Defined DCN Power Optimization., , , и . IEEE Access, (2024)On the Complexity of Fixed-Size Bit-Vector Logics with Binary Encoded Bit-Width., , и . SMT@IJCAR, том 20 из EPiC Series in Computing, стр. 44-56. EasyChair, (2012)Integer Programming Based Optimization of Power Consumption for Data Center Networks., и . Acta Cybern., 26 (3): 563-579 (2023)CAML - A Universal Configuration Language for Dialogue Systems., , и . DEXA, том 2736 из Lecture Notes in Computer Science, стр. 896-906. Springer, (2003)Metamodels in generation of UML using NLI-based dialog., , и . SACI, стр. 29-34. IEEE, (2009)Generating Optimal Scheduling for Wireless Sensor Networks by Using Optimization Modulo Theories Solvers., , и . SMT, том 1889 из CEUR Workshop Proceedings, стр. 15-27. CEUR-WS.org, (2017)More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding., , и . CSR, том 7913 из Lecture Notes in Computer Science, стр. 378-390. Springer, (2013)iDQ: Instantiation-Based DQBF Solving., , , и . POS@SAT, том 27 из EPiC Series in Computing, стр. 103-116. EasyChair, (2014)Portfolio SAT and SMT Solving of Cardinality Constraints in Sensor Network Optimization., , и . SYNASC, стр. 85-91. IEEE, (2019)On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic., , , и . MFCS (2), том 8635 из Lecture Notes in Computer Science, стр. 481-492. Springer, (2014)