Scheduling with two non-unit task lengths is NP-complete

Autor: Elffers, Jan, de Weerdt, Mathijs

The non-preemptive job scheduling problem with release times and deadlines on a single machine is fundamental to many scheduling problems. We parameterize this problem by the set of job lengths the jobs can have. The case where all job lengths are id

Externí odkaz: http://arxiv.org/abs/1412.3095

Verifying Properties of Bit-vector Multiplication Using Cutting Planes Reasoning

Autor: Liew, Vincent, Beame, Paul, Devriendt, Jo, Elffers, Jan, Nordström, Jakob

Publikováno v: Liew, V, Beame, P, Devriendt, J, Elffers, J & Nordström, J 2020, Verifying Properties of Bit-vector Multiplication Using Cutting Planes Reasoning . in Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design (FMCAD '20) ., 9283622, IEEE, pp. 194-204, 20th International Conference on Formal Methods in Computer-Aided Design-FMCAD 2020;, Virtual, 21/09/2020 . https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_27

Systems mixing Boolean logic and arithmetic have been a long-standing challenge for verification tools such as SAT-based bit-vector solvers. Though SAT solvers can be highly efficient for Boolean reasoning, they scale poorly once multiplication is in

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______2751::530ade98461ededd5792959acc6fb2a8
https://curis.ku.dk/portal/da/publications/verifying-properties-of-bitvector-multiplication-using-cutting-planes-reasoning(d08d12c1-8aad-4d9e-9cc1-52679e7c5673).html