{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T10:47:46Z","timestamp":1794480466631,"version":"4.9.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319092836","type":"print"},{"value":"9783319092843","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09284-3_17","type":"book-chapter","created":{"date-parts":[[2014,7,2]],"date-time":"2014-07-02T05:43:21Z","timestamp":1404279801000},"page":"219-226","source":"Crossref","is-referenced-by-count":36,"title":["A SAT Attack on the Erd\u0151s Discrepancy Conjecture"],"prefix":"10.1007","author":[{"given":"Boris","family":"Konev","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexei","family":"Lisitsa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Beck, J., Chen, W.W.L.: Irregularities of Distribution. Cambridge University Press (1987)","DOI":"10.1017\/CBO9780511565984"},{"key":"17_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626371","volume-title":"The Discrepancy Method: Randomness and Complexity","author":"B. Chazelle","year":"2000","unstructured":"Chazelle, B.: The Discrepancy Method: Randomness and Complexity. Cambridge University Press, New York (2000)"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Matousek, J.: Geometric Discrepancy: An Illustrated Guide. Algorithms and combinatorics, vol.\u00a018. Springer (1999)","DOI":"10.1007\/978-3-642-03942-3"},{"key":"17_CR4","unstructured":"Beck, J., S\u00f3s, V.T.: Discrepancy theory. In: Graham, R.L., Gr\u00f6tschel, M., Lov\u00e1sz, L. (eds.) Handbook of Combinatorics, vol.\u00a02, pp. 1405\u20131446. Elsivier (1995)"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0166-218X(92)90121-P","volume":"37\/38","author":"N. Alon","year":"1992","unstructured":"Alon, N.: Transmitting in the n-dimensional cube. Discrete Applied Mathematics\u00a037\/38, 9\u201311 (1992)","journal-title":"Discrete Applied Mathematics"},{"key":"17_CR6","first-page":"1285","volume-title":"Proceedings of the 44th Symposium on Theory of Computing, STOC 2012","author":"S. Muthukrishnan","year":"2012","unstructured":"Muthukrishnan, S., Nikolov, A.: Optimal private halfspace counting via discrepancy. In: Proceedings of the 44th Symposium on Theory of Computing, STOC 2012, pp. 1285\u20131292. ACM, New York (2012)"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1090\/S0894-0347-96-00175-0","volume":"9","author":"J. Matousek","year":"1996","unstructured":"Matousek, J., Spencer, J.: Discrepancy in arithmetic progressions. Journal of the American Mathematical Society\u00a09, 195\u2013204 (1996)","journal-title":"Journal of the American Mathematical Society"},{"key":"17_CR8","doi-asserted-by":"crossref","first-page":"257","DOI":"10.4064\/aa-9-3-257-260","volume":"9","author":"K.F. Roth","year":"1964","unstructured":"Roth, K.F.: Remark concerning integer sequence. Acta Arithmetica\u00a09, 257\u2013260 (1964)","journal-title":"Acta Arithmetica"},{"issue":"3","key":"17_CR9","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1307\/mmj\/1028997963","volume":"4","author":"P. Erd\u0151s","year":"1957","unstructured":"Erd\u0151s, P.: Some unsolved problems. The Michigan Mathematical Journal\u00a04(3), 291\u2013300 (1957)","journal-title":"The Michigan Mathematical Journal"},{"key":"17_CR10","unstructured":"Nikolov, A., Talwar, K.: On the hereditary discrepancy of homogeneous arithmetic progressions. CoRR abs\/1309.6034v1 (2013)"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Gowers, T.: Erd\u0151s and arithmetic progressoins. In: Erd\u0151s Centennial Conference (2013), http:\/\/www.renyi.hu\/conferences\/erdos100\/program.html , (accessed January 29, 2014)","DOI":"10.1007\/978-3-642-39286-3_8"},{"issue":"12","key":"17_CR12","doi-asserted-by":"publisher","first-page":"6279","DOI":"10.1090\/S0002-9947-2010-05235-3","volume":"362","author":"P. Borwein","year":"2010","unstructured":"Borwein, P., Choi, S.K.K., Coons, M.: Completely multiplicative functions taking values in { 1,\u2009\u2212\u20091 }. Transactions of the American Mathematical Society\u00a0362(12), 6279\u20136291 (2010)","journal-title":"Transactions of the American Mathematical Society"},{"key":"17_CR13","unstructured":"Mathias, A.R.D.: On a conjecture of Erd\u0151s and \u010cudakov. In: Combinatorics, Geometry and Probability (1993)"},{"key":"17_CR14","unstructured":"Erd\u0151s discrepancy problem: Polymath wiki, http:\/\/michaelnielsen.org\/polymath1\/index.php?title=The_Erd (accessed January 29, 2014)"},{"key":"17_CR15","unstructured":"Gowers, T.: Is massively collaborative mathematics possible, http:\/\/gowers.wordpress.com\/2009\/01\/27\/is-massively-collaborative-mathematics-possible\/ (accessed January 29 , 2014)"},{"key":"17_CR16","unstructured":"Konev, B., Lisitsa, A.: Addendum to: A SAT attack on the Erd\u0151s discrepancy conjecture, http:\/\/www.csc.liv.ac.uk\/~konev\/SAT14"},{"key":"17_CR17","unstructured":"Biere, A.: Bounded model checking. In: Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol.\u00a0185, pp. 457\u2013481. IOS Press (2009)"},{"key":"17_CR18","unstructured":"Biere, A.: Lingeling, Plingeling and Treengeling entering the SAT Competition 2013. In: Proceedings of SAT Competition 2013, pp. 51\u201352. University of Helsinki (2013)"},{"key":"17_CR19","unstructured":"Balint, A., Belov, A., Heule, M.J.H., J\u00e4rvisalo, M. (eds.): Proceedings of SAT competition 2013. University of Helsinki (2013)"},{"key":"17_CR20","unstructured":"Audemard, G., Simon, L.: Glucose 2.3 in the SAT 2013 Competition. In: Proceedings of SAT Competition 2013, pp. 42\u201343. University of Helsinki (2013)"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Goldberg, E.I., Novikov, Y.: Verification of proofs of unsatisfiability for CNF formulas. In: Proceedings of Design, Automation and Test in Europe Conference and Exposition (DATE 2003), Munich, Germany, March 3-7, pp. 10886\u201310891 (2003)","DOI":"10.1109\/DATE.2003.1253718"},{"key":"17_CR22","unstructured":"Heule, M.J.H.: DRUP checker, http:\/\/www.cs.utexas.edu\/~marijn\/drup\/ (accessed January 29 , 2014)"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Konev, B., Lisitsa, A.: A sat attack on the erdos discrepancy conjecture. CoRR abs\/1402.2184 (2014)","DOI":"10.1007\/978-3-319-09284-3_17"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09284-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,10]],"date-time":"2022-04-10T05:27:46Z","timestamp":1649568466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09284-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319092836","9783319092843"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09284-3_17","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-09284-3","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}