{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:45:04Z","timestamp":1725795904216},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439470"},{"type":"electronic","value":"9783662439487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_55","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T12:10:36Z","timestamp":1402488636000},"page":"663-675","source":"Crossref","is-referenced-by-count":3,"title":["On the Complexity of Trial and Error for Constraint Satisfaction Problems"],"prefix":"10.1007","author":[{"given":"G\u00e1bor","family":"Ivanyos","sequence":"first","affiliation":[]},{"given":"Raghav","family":"Kulkarni","sequence":"additional","affiliation":[]},{"given":"Youming","family":"Qiao","sequence":"additional","affiliation":[]},{"given":"Miklos","family":"Santha","sequence":"additional","affiliation":[]},{"given":"Aarthi","family":"Sundaram","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"55_CR1","doi-asserted-by":"crossref","unstructured":"Bei, X., Chen, N., Dou, L., Huang, X., Qiang, R.: Trial and error in influential social networks. In: KDD, pp. 1016\u20131024 (2013)","DOI":"10.1145\/2487575.2487669"},{"key":"55_CR2","doi-asserted-by":"crossref","unstructured":"Bei, X., Chen, N., Zhang, S.: On the complexity of trial and error. In: STOC, pp. 31\u201340 (2013)","DOI":"10.1145\/2488608.2488613"},{"key":"55_CR3","unstructured":"Bei, X., Chen, N., Zhang, S.: Solving linear programming with constraints unknown. CoRR, abs\/1304.1247 (2013)"},{"issue":"1","key":"55_CR4","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/S0097539794266766","volume":"28","author":"T. Feder","year":"1999","unstructured":"Feder, T., Vardi, M.Y.: The computational structure of monotone monadic snp and constraint satisfaction: A study through datalog and group theory. SIAM J. Comput.\u00a028(1), 57\u2013104 (1999)","journal-title":"SIAM J. Comput."},{"key":"55_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-540-69407-6_45","volume-title":"Logic and Theory of Algorithms","author":"B. Martin","year":"2008","unstructured":"Martin, B.: First-order model checking problems parameterized by the model. In: Beckmann, A., Dimitracopoulos, C., L\u00f6we, B. (eds.) CiE 2008. LNCS, vol.\u00a05028, pp. 417\u2013427. Springer, Heidelberg (2008)"},{"key":"55_CR6","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: STOC, pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"}],"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-662-43948-7_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T22:13:31Z","timestamp":1558908811000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}