{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:50:57Z","timestamp":1725565857491},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228493"},{"type":"electronic","value":"9783540278368"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_41","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T18:53:21Z","timestamp":1284576801000},"page":"469-480","source":"Crossref","is-referenced-by-count":2,"title":["Locally Consistent Constraint Satisfaction Problems"],"prefix":"10.1007","author":[{"given":"Zden\u011bk","family":"Dvo\u0159\u00e1k","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Kr\u00e1l\u2019","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ond\u0159ej","family":"Pangr\u00e1c","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","first-page":"29","volume-title":"Proc. of the 3rd ACM Symposium on Theory of Computing","author":"S. Cook","year":"1971","unstructured":"Cook, S.: The Complexity of Theorem-proving Procedures. In: Proc. of the 3rd ACM Symposium on Theory of Computing, pp. 29\u201333. ACM, New York (1971)"},{"key":"41_CR2","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","volume-title":"Satisfiability Problem: Theory and Applications","author":"S. Cook","year":"1997","unstructured":"Cook, S., Mitchell, D.: Finding Hard Instances of the Satisfiability Problem: A Survey. In: Satisfiability Problem: Theory and Applications. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a035, AMS, Providence (1997)"},{"key":"41_CR3","first-page":"329","volume-title":"Proc. of the 12th ACM-SIAM Symposium on Discrete Algorithms","author":"D. Eppstein","year":"2001","unstructured":"Eppstein, D.: Improved Algorithms for 3-coloring, 3-edge-coloring and Constraint Satisfaction. In: Proc. of the 12th ACM-SIAM Symposium on Discrete Algorithms, pp. 329\u2013337. SIAM, Philadelphia (2001)"},{"issue":"2","key":"41_CR4","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/S0196-6774(02)00224-9","volume":"45","author":"T. Feder","year":"2002","unstructured":"Feder, T., Motwani, R.: Worst-case Time Bounds for Coloring and Satisfiability Problems. J. Algorithms\u00a045(2), 192\u2013201 (2002)","journal-title":"J. Algorithms"},{"key":"41_CR5","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","volume":"33","author":"T. Hagerup","year":"1989","unstructured":"Hagerup, T., R\u00fcb, C.: A guided tour Chernoff bounds. Inform. Process. Letters\u00a033, 305\u2013308 (1989)","journal-title":"Inform. Process. Letters"},{"key":"41_CR6","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0304-3975(85)90166-5","volume":"40","author":"M.A. Huang","year":"1985","unstructured":"Huang, M.A., Lieberherr, K.: Implications of Forbidden Structures for Extremal Algorithmic Problems. Theoretical Computer Science\u00a040, 195\u2013210 (1985)","journal-title":"Theoretical Computer Science"},{"key":"41_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04650-0","volume-title":"Extremal Combinatorics with Applications in Computer Science","author":"S. Jukna","year":"2001","unstructured":"Jukna, S.: Extremal Combinatorics with Applications in Computer Science. Springer, Heidelberg (2001)"},{"key":"41_CR8","first-page":"323","volume-title":"Proc. of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"D. Kr\u00e1l","year":"2004","unstructured":"Kr\u00e1l, D.: Locally Satisfiable Formulas. In: Proc. of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 323\u2013332. SIAM, Philadelphia (2004)"},{"issue":"2","key":"41_CR9","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1145\/322248.322260","volume":"28","author":"K. Lieberherr","year":"1981","unstructured":"Lieberherr, K., Specker, E.: Complexity of Partial Satisfaction. J. of the ACM\u00a028(2), 411\u2013422 (1981)","journal-title":"J. of the ACM"},{"key":"41_CR10","unstructured":"Lieberherr, K., Specker, E.: Complexity of Partial Satisfaction II. Technical Report 293, Dept. of EECS, Princeton University (1982)"},{"key":"#cr-split#-41_CR11.1","doi-asserted-by":"crossref","unstructured":"Trevisan, L.: On Local versus Global Satisfiability. SIAM J. Disc. Math. (to appear);","DOI":"10.1137\/S0895480197326528"},{"key":"#cr-split#-41_CR11.2","unstructured":"A preliminary version is available as ECCC report TR97-12"},{"key":"41_CR12","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1214\/aoms\/1177703585","volume":"35","author":"Z. Usiskin","year":"1963","unstructured":"Usiskin, Z.: Max-min Probabilities in the Voting Paradox. Ann. Math. Stat.\u00a035, 857\u2013862 (1963)","journal-title":"Ann. Math. Stat."},{"key":"41_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-36478-1_17","volume-title":"Combinatorial Optimization - Eureka, You Shrink!","author":"G.J. Woeginger","year":"2003","unstructured":"Woeginger, G.J.: Exact Algorithms for NP-hard Problems: A Survey. In: J\u00fcnger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization - Eureka, You Shrink! LNCS, vol.\u00a02570, pp. 185\u2013207. Springer, Heidelberg (2003)"},{"key":"41_CR14","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1006\/jagm.1994.1045","volume":"17","author":"M. Yannakakis","year":"1994","unstructured":"Yannakakis, M.: On the Approximation of Maximum Satisfiability. J. Algorithms\u00a017, 475\u2013502 (1994)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:30:58Z","timestamp":1619998258000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}