{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:03:59Z","timestamp":1725480239190},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405054"},{"type":"electronic","value":"9783540450665"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45066-1_18","type":"book-chapter","created":{"date-parts":[[2007,2,28]],"date-time":"2007-02-28T07:41:13Z","timestamp":1172648473000},"page":"225-236","source":"Crossref","is-referenced-by-count":0,"title":["Boolean NP-Partitions and Projective Closure"],"prefix":"10.1007","author":[{"given":"Sven","family":"Kosub","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"issue":"6","key":"18_CR1","doi-asserted-by":"publisher","first-page":"1232","DOI":"10.1137\/0217078","volume":"17","author":"J.-Y. Cai","year":"1988","unstructured":"J.-Y. Cai, T. Gundermann, J. Hartmanis, L.A. Hemachandra, V. Sewelson, K.W. Wagner, and G. Wechsung. The boolean hierarchy I: Structural properties. SIAM Journal on Computing, 17(6):1232\u20131252, 1988.","journal-title":"SIAM Journal on Computing"},{"key":"18_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/3-540-16486-3_93","volume-title":"Proceedings 1st Structure in Complexity Theory Conference","author":"J.-Y. Cai","year":"1986","unstructured":"J.-Y. Cai and L. A. Hemachandra. The Boolean hierarchy: Hardware over NP. In Proceedings 1st Structure in Complexity Theory Conference, volume 223 of Lecture Notes in Computer Science, pages 105\u2013124. Springer-Verlag, Berlin, 1986."},{"key":"18_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-0348-7633-9","volume-title":"General Lattice Theory","author":"G. Gr\u00e4tzer","year":"1978","unstructured":"G. Gr\u00e4tzer. General Lattice Theory. Akademie-Verlag, Berlin, 1978."},{"key":"18_CR4","series-title":"An EATCS Series","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04880-1","volume-title":"The Complexity Theory Companion","author":"L. A. Hemaspaandra","year":"2002","unstructured":"L. A. Hemaspaandra and M. Ogihara. The Complexity Theory Companion. Texts in Theoretical Computer Science. An EATCS Series. Springer-Verlag, Berlin, 2002."},{"issue":"4","key":"18_CR5","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1051\/ita\/1987210404191","volume":"21","author":"J. K\u00f6bler","year":"1987","unstructured":"J. K\u00f6bler, U. Sch\u00f6ning, and K.W. Wagner. The difference and truth-table hierarchies for NP. RAIRO Theoretical Informatics and Applications, 21(4):419\u2013435, 1987.","journal-title":"RAIRO Theoretical Informatics and Applications"},{"key":"18_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/3-540-44612-5_42","volume-title":"Proceedings 25th Symposium on Mathematical Foundations of Computer Science","author":"S. Kosub","year":"2000","unstructured":"S. Kosub. On NP-partitions over posets with an application of reducing the set of solutions of NP problems. In Proceedings 25th Symposium on Mathematical Foundations of Computer Science, volume 1893 of Lecture Notes in Computer Science, pages 467\u2013476. Springer-Verlag, Berlin, 2000."},{"key":"18_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/3-540-46541-3_13","volume-title":"Proceedings 17th Symposium on Theoretical Aspects of Computer Science","author":"S. Kosub","year":"2000","unstructured":"S. Kosub and K.W. Wagner. The boolean hierarchy of NP-partitions. In Proceedings 17th Symposium on Theoretical Aspects of Computer Science, volume 1770 of Lecture Notes in Computer Science, pages 157\u2013168. Springer-Verlag, Berlin, 2000. Expanded version available as Technical Report TUM-I0209, Technische Universit\u00e4t M\u00fcnchen, Institut f\u00fcr Informatik, September 2002."},{"key":"18_CR8","series-title":"Lect Notes Comput Sci","first-page":"485","volume-title":"Proceedings 5th International Conference on Fundamentals in Computation Theory","author":"K.W. Wagner","year":"1985","unstructured":"K.W. Wagner and G. Wechsung. On the boolean closure of NP. Extended abstract as: G. Wechsung. On the boolean closure of NP. Proceedings 5th International Conference on Fundamentals in Computation Theory, volume 199 of Lecture Notes in Computer Science, pages 485\u2013493, Berlin, 1985."}],"container-title":["Lecture Notes in Computer Science","Discrete Mathematics and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45066-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T21:24:29Z","timestamp":1550265869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45066-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405054","9783540450665"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-45066-1_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}