{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:49:43Z","timestamp":1725562183404},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212980"},{"type":"electronic","value":"9783540247272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24727-2_6","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T11:06:41Z","timestamp":1280747201000},"page":"58-71","source":"Crossref","is-referenced-by-count":1,"title":["Hypergraphs and Degrees of Parallelism: A Completeness Result"],"prefix":"10.1007","author":[{"given":"Antonio","family":"Bucciarelli","sequence":"first","affiliation":[]},{"given":"Benjamin","family":"Leperchey","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"An annotated list of selected NP-complete problems, http:\/\/www.csc.liv.ac.uk\/~ped\/teachadmin\/COMP202\/annotated_np.html"},{"key":"6_CR2","volume-title":"Cambridge Tracts in Theoretical Computer Science","author":"R.M. Amadio","year":"1998","unstructured":"Amadio, R.M., Curien, P.-L.: Domains and Lambda-Calculi. In: Cambridge Tracts in Theoretical Computer Science, vol.\u00a046, Cambridge University Press, Cambridge (1998)"},{"issue":"1","key":"6_CR3","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0304-3975(96)00234-4","volume":"177","author":"A. Bucciarelli","year":"1997","unstructured":"Bucciarelli, A.: Degrees of parallelism in the continuous type hierarchy. Theoretical Computer Science\u00a0177(1), 59\u201371 (1997)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"6_CR4","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1006\/inco.1994.1033","volume":"110","author":"A. Bucciarelli","year":"1994","unstructured":"Bucciarelli, A., Ehrhard, T.: Sequentiality in an extensional framework. Information and Computation\u00a0110(2), 265\u2013296 (1994)","journal-title":"Information and Computation"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0304-3975(00)00332-7","volume":"278","author":"A. Bucciarelli","year":"2002","unstructured":"Bucciarelli, A., Malacaria, P.: Relative definability of boolean functions via hypergraphs. Theoretical Computer Science\u00a0278, 91\u2013110 (2002)","journal-title":"Theoretical Computer Science"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Curien, P.-L.: Categorical Combinators,Sequential Algorithms and Functional Programming. Birkh\u00e4user, revised edition (1993)","DOI":"10.1007\/978-1-4612-0317-9"},{"issue":"1\u2013 2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/S0304-3975(00)00194-8","volume":"266","author":"R. Loader","year":"2001","unstructured":"Loader, R.: Finitary PCF is not decidable. Theoretical Computer Science\u00a0266(1\u2013 2), 341\u2013364 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"6_CR8","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G.D. Plotkin","year":"1977","unstructured":"Plotkin, G.D.: LCF considered as a programming language. Theoretical Computer Science\u00a05(3), 223\u2013255 (1977)","journal-title":"Theoretical Computer Science"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Pucella, Panangaden.: On the expressive power of first-order boolean functions in PCF. TCS: Theoretical Computer Science, 266 (2001)","DOI":"10.1016\/S0304-3975(00)00282-6"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/3-540-07854-1_223","volume-title":"Mathematical Foundations of Computer Science 1976","author":"V.Y. Sazonov","year":"1976","unstructured":"Sazonov, V.Y.: Degrees of parallelism in computations. In: Mazurkiewicz, A. (ed.) MFCS 1976. LNCS, vol.\u00a045, pp. 517\u2013523. Springer, Heidelberg (1976)"},{"issue":"1\u20132","key":"6_CR11","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/0304-3975(93)90095-B","volume":"121","author":"D.S. Scott","year":"1993","unstructured":"Scott, D.S.: A type-theoretical alternative to ISWIM, CUCH, OWHY. Theoretical Computer Science\u00a0121(1\u20132), 411\u2013440 (1993)","journal-title":"Theoretical Computer Science"},{"key":"6_CR12","series-title":"LMS","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1017\/CBO9780511525902.015","volume-title":"Proc. LMS Symposium on Applications of Categories in Computer Science","author":"K. Sieber","year":"1992","unstructured":"Sieber, K.: Reasoning about sequential functions via logical relations. In: Fourman, M.P., Johnstone, P.T., Pitts, A.M. (eds.) Proc. LMS Symposium on Applications of Categories in Computer Science, Durham. LMS, vol.\u00a0177, pp. 258\u2013269. Cambridge University Press, Cambridge (1992)"},{"key":"6_CR13","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/3-540-58027-1_18","volume":"802","author":"A. Stoughton","year":"1994","unstructured":"Stoughton, A.: Mechanizing logical relations. Lecture Notes in Computer Science\u00a0802, 359\u2013377 (1994)","journal-title":"Lecture Notes in Computer Science"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Mathematical Foundations of Computer Science 1975","author":"M.B. Trackhtenbrot","year":"1975","unstructured":"Trackhtenbrot, M.B.: On representation of sequential and parallel functions. In: Becvar, J. (ed.) MFCS 1975. LNCS, vol.\u00a032, Springer, Heidelberg (1975)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24727-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:22:52Z","timestamp":1559344972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24727-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212980","9783540247272"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24727-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}