A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Bounded queries to SAT and the Boolean hierarchy
1991
Theoretical Computer Science
Preserved Fulltext
Beige], R., Bounded queries to SAT and the Boolean hierarchy, Theoretical Computer Science 84(1991)199-223.
doi:10.1016/0304-3975(91)90160-4
fatcat:q5kfoes22jb3lk3hzwpntdywxa