Therese Biedl, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Paul Nijjar, Ryuhei Uehara, ...
We prove that there is a polyhedron with genus 6 whose faces are orthogonal polygons (equivalently, rectangles) and yet the angles between some faces are not multiples of 90, so the polyhedron itself...
An Attempt to Automate <i>NP</i>-Hardness Reductions via <i>SO</i>∃ Logic (2004)
We explore the possibility of automating <i>NP</i>-hardness reductions. We motivate the problem from an artificial intelligence perspective, then propose the use of second-order...
An Attempt to Automate NP-Hardness Reductions via SO∃ Logic (2004)
We explore the possibility of automating NP-hardness reductions. We motivate the problem from an artificial intelligence perspective, then propose the use of second-order existential (SO∃) logic as...
An Attempt to Automate NP-Hardness Reductions via SO∃ Logic (2004)
We explore the possibility of automating NP-hardness reductions. We motivate the problem from an artificial intelligence perspective, then propose the use of second-order existential (SO∃)...
An Attempt to Automate NP-Hardness Reductions via SO∃ Logic (2004)
We explore the possibility of automating NP-hardness reductions. We motivate the problem from an artificial intelligence perspective, then propose the use of second-order existential (SO∃) logic as...
An attempt to automate NP-hardness reductions via SOE logic (2004)
Thesis (MMath)--University of Waterloo, 2004.
An attempt to automate np-hardness reductions via SO∃ logic (2004)
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be...
An Attempt to Automate NP-Hardness Reductions via SO∃ Logic (2004)
We explore the possibility of automating NP-hardness reductions. We motivate the problem from an artificial intelligence perspective, then propose the use of second-order existential (SO∃) logic as...