Results 41 to 50 of about 943 (76)
Towards Verifying Nonlinear Integer Arithmetic
, 2018 We eliminate a key roadblock to efficient verification of nonlinear integer arithmetic using CDCL SAT solvers, by showing how to construct short resolution proofs for many properties of the most widely used multiplier circuits.
B Bollig +15 more
core +1 more source
, 2012 We present a logic for the specification of static analysis problems that goes beyond the logics traditionally used. Its most prominent feature is the direct support for both inductive computations of behaviors as well as co-inductive specifications of ...
Filipiuk, Piotr +2 more
core +1 more source
Extending greedy feature selection algorithms to multiple solutions. [PDF]
Data Min Knowl Discov, 2021 Borboudakis G, Tsamardinos I.
europepmc +1 more source
Quantum vs. Classical Read-once Branching Programs
, 2005 The paper presents the first nontrivial upper and lower bounds for (non-oblivious) quantum read-once branching programs. It is shown that the computational power of quantum and classical read-once branching programs is incomparable in the following sense:
Sauerhoff, Martin
core +1 more source
On OBDD Transformations Representing Finite State Automata [PDF]
, 2003 We present OBDD transformation problem representing finite labeled transition systems corresponding to some congruence relation. Transformations are oriented toward obtaining the OBDD of a minimized transition system for this congruence ...
Grzywacz, Wioletta, Kryvyy, Sergey
core
On Compiling Structured CNFs to OBDDs. [PDF]
Theory Comput Syst, 2017 Bova S, Slivovsky F.
europepmc +1 more source
Nanowire systems: technology and design. [PDF]
Philos Trans A Math Phys Eng Sci, 2014 Gaillardon PE +5 more
europepmc +1 more source