Global ETD Search

1	Backdoors in Satisfiability Problems Li, Zijie January 2009 (has links) Although satisfiability problems (SAT) are NP-complete, state-of-the-art SAT solvers are able to solve large practical instances. The notion of backdoors has been introduced to capture structural properties of instances. Backdoors are a set of variables for which there exists some value assignment that leads to a polynomial-time solvable sub-problem. I address in this thesis the problem of finding all minimal backdoors, which is essential for studying value and variable ordering mistakes. I discuss our definition of sub-solvers and propose algorithms for finding backdoors. I implement our proposed algorithms by modifying a state-of-the-art SAT solver, Minisat. I analyze experimental results comparing our proposed algorithms to previous algorithms applied to random 3SAT, structured, and real-world instances. Our proposed algorithms improve over previous algorithms for finding backdoors in two ways. First, our algorithms often find smaller backdoors. Second, our algorithms often find a much larger number of backdoors. CSP SAT Backdoors Computer Science
2	Backdoors in Satisfiability Problems Li, Zijie January 2009 (has links) Although satisfiability problems (SAT) are NP-complete, state-of-the-art SAT solvers are able to solve large practical instances. The notion of backdoors has been introduced to capture structural properties of instances. Backdoors are a set of variables for which there exists some value assignment that leads to a polynomial-time solvable sub-problem. I address in this thesis the problem of finding all minimal backdoors, which is essential for studying value and variable ordering mistakes. I discuss our definition of sub-solvers and propose algorithms for finding backdoors. I implement our proposed algorithms by modifying a state-of-the-art SAT solver, Minisat. I analyze experimental results comparing our proposed algorithms to previous algorithms applied to random 3SAT, structured, and real-world instances. Our proposed algorithms improve over previous algorithms for finding backdoors in two ways. First, our algorithms often find smaller backdoors. Second, our algorithms often find a much larger number of backdoors. CSP SAT Backdoors Computer Science
3	A Solder-Defined Computer Architecture for Backdoor and Malware Resistance Abel, Marc W. January 2022 (has links) No description available. Computer Engineering Computer Science 36-bit arithmetic logic unit maker movement maker-scale assembly tool minicomputer open-source hardware right to repair SRAM logic SRAM minicomputer solder-defined behavior solder-defined computer solder-defined hardware supply-chain firewall VLSI backdoors VLSI tampering

1

Page generated in 0.023 seconds