{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:13:12Z","timestamp":1725516792466},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540697329"},{"type":"electronic","value":"9783540697336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69733-6_20","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"191-203","source":"Crossref","is-referenced-by-count":0,"title":["Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments"],"prefix":"10.1007","author":[{"given":"Takayuki","family":"Sato","sequence":"first","affiliation":[]},{"given":"Kazuyuki","family":"Amano","sequence":"additional","affiliation":[]},{"given":"Eiji","family":"Takimoto","sequence":"additional","affiliation":[]},{"given":"Akira","family":"Maruoka","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Bollob\u00e1s, B.: Relations between Sets of Complete Subgraphs. In: Proc. 5th British Comb. Conf., pp. 79\u201384 (1975)"},{"key":"20_CR2","volume-title":"Extremal Graph Theory","author":"B. Bollob\u00e1s","year":"1978","unstructured":"Bollob\u00e1s, B.: Extremal Graph Theory. Academic Press, New York (1978)"},{"key":"20_CR3","volume-title":"Combinatorics","author":"B. Bollob\u00e1s","year":"1986","unstructured":"Bollob\u00e1s, B.: Combinatorics. Cambridge University Press, Cambridge (1986)"},{"key":"20_CR4","doi-asserted-by":"crossref","DOI":"10.1201\/9781439863879","volume-title":"Erd\u0151s on Graphs","author":"F. Chung","year":"1998","unstructured":"Chung, F., Graham, R.: Erd\u0151s on Graphs. Wellesley, Massachusetts (1998)"},{"key":"20_CR5","first-page":"290","volume":"94","author":"P. Erd\u0151s","year":"1969","unstructured":"Erd\u0151s, P.: On the Number of Complete Subgraphs Contained in Certain Graphs. Caspois Pest. Mat.\u00a094, 290\u2013296 (1969)","journal-title":"Caspois Pest. Mat."},{"issue":"4","key":"20_CR6","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1002\/jgt.3190130411","volume":"13","author":"D. Fisher","year":"1989","unstructured":"Fisher, D.: Lower Bounds on the Number of Triangles in a Graph. J. Graph Theory\u00a013(4), 505\u2013512 (1989)","journal-title":"J. Graph Theory"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/PL00001601","volume":"9","author":"C. Greenhill","year":"2000","unstructured":"Greenhill, C.: The Complexity of Counting Colorings and Independent Sets in Sparse Graphs and Hypergraphs. Computational Complexity\u00a09, 52\u201373 (2000)","journal-title":"Computational Complexity"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Kruskal, J.B.: The Number of Simplices in a Complex. In: Bellman, R. (ed.) Mathematical Optimization Techniques, pp. 251\u2013278. University of California Press (1963)","DOI":"10.1525\/9780520319875-014"},{"key":"20_CR9","unstructured":"Katona, G.O.H.: A Theorem on Finite Sets. In: Erd\u0151s, P., Katona, G. (eds.) Theory of Graphs, pp. 187\u2013207. Akad\u00e9miai Kiad\u00f3 and Academic Press (1968)"},{"key":"20_CR10","volume-title":"Handbook of Discrete and Combinatorial Mathematics","author":"K.H. Rosen","year":"2000","unstructured":"Rosen, K.H.: Handbook of Discrete and Combinatorial Mathematics. CRC Press, New York (2000)"},{"key":"20_CR11","first-page":"436","volume":"48","author":"P. Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n, P.: On an Extremal Problem in Graph Theory (in Hungarian). Mat. Fiz. Lapok\u00a048, 436\u2013452 (1941)","journal-title":"Mat. Fiz. Lapok"},{"issue":"2","key":"20_CR12","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1137\/S0097539797321602","volume":"31","author":"S.P. Vadhan","year":"2001","unstructured":"Vadhan, S.P.: The Complexity of Counting in Sparse, Regular, and Planar Graphs. SIAM J. Comput.\u00a031(2), 398\u2013427 (2001)","journal-title":"SIAM J. Comput."},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The Complexity of Computing the Permanent. Theoret. Comput. Sci.\u00a08, 189\u2013201 (1979)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69733-6_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T13:59:21Z","timestamp":1631627961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69733-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540697329","9783540697336"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69733-6_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}