.../0305-4470/28/19/016 Boolean Satisfiability solvers improved dramatically over the last seven years and are commonly used in applications such as bounded model checking, planning, and... new general constructions of SBPs. http://www.it.uu.se/research/group/astra/SymCon02/Proceedings/AloulMarkovSakallah.pdf I will try to find the exact thing in wiki's competator....

.../abstract/0305-4470/28/19/016 Boolean Satisfiability solvers improved dramatically over the last seven years and are commonly used in applications such as bounded model checking, planning, and ...well as new general constructions of SBPs. http://www.it.uu.se/research/group/astra/SymCon02/Proceedings/AloulMarkovSakallah.pdf I will try to find the exact thing in wiki's competator...

...://www.iop.org/EJ/abstract/0305-4470/28/19/016 Boolean Satisfiability solvers improved dramatically over the last seven years and are commonly used in applications such as bounded model checking, planning, and FPGA routing. However...SBPs and their efficiency as well as new general constructions of SBPs. http://www.it.uu.se/research/group/astra/SymCon02/Proceedings/AloulMarkovSakallah.pdf

...://www.iop.org/EJ/abstract/0305-4470/28/19/016 Boolean Satisfiability solvers improved dramatically over the last seven years and are commonly used in applications such as bounded model checking, planning, and FPGA routing. However...SBPs and their efficiency as well as new general constructions of SBPs. http://www.it.uu.se/research/group/astra/SymCon02/Proceedings/AloulMarkovSakallah.pdf

...://www.iop.org/EJ/abstract/0305-4470/28/19/016 Boolean Satisfiability solvers improved dramatically over the last seven years and are commonly used in applications such as bounded model checking, planning, and FPGA routing. However...SBPs and their efficiency as well as new general constructions of SBPs. http://www.it.uu.se/research/group/astra/SymCon02/Proceedings/AloulMarkovSakallah.pdf