{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T16:41:50Z","timestamp":1725813710937},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319135236"},{"type":"electronic","value":"9783319135243"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13524-3_4","type":"book-chapter","created":{"date-parts":[[2014,12,2]],"date-time":"2014-12-02T12:51:38Z","timestamp":1417524698000},"page":"39-50","source":"Crossref","is-referenced-by-count":0,"title":["Solving Linear Equations Parameterized by Hamming Weight"],"prefix":"10.1007","author":[{"given":"Vikraman","family":"Arvind","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"K\u00f6bler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Kuhnert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacobo","family":"Tor\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,3]]},"reference":[{"issue":"4","key":"4_CR1","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color coding. J. ACM 42(4), 844\u2013856 (1995)","journal-title":"J. ACM"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"ER Berlekamp","year":"1978","unstructured":"Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.A.: On the inherent intractability of certain coding problems. IEEE Trans. Inform. Theory 24, 384\u2013386 (1978)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Berlin (1999)"},{"issue":"2","key":"4_CR4","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/S0097539797323571","volume":"29","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R., Vardy, A., Whittle, G.: The parametrized complexity of some fundamental problems in coding theory. SIAM J. Comput. 29(2), 545\u2013570 (1999)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"4_CR5","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/TIT.2002.806118","volume":"49","author":"I Dumer","year":"2003","unstructured":"Dumer, I., Micciancio, D., Sudan, M.: Hardness of approximating the minimum distance of a linear code. IEEE Trans. Inform. Theory 49(1), 22\u201337 (2003)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Elberfeld, M., Jakoby, A., Tantau, T.: Logspace versions of the theorems of Bodlaender and Courcelle. In: FOCS Conference, pp. 143\u2013152 (2010)","DOI":"10.1109\/FOCS.2010.21"},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1145\/1077464.1077476","volume":"1","author":"DS Johnson","year":"2005","unstructured":"Johnson, D.S.: The NP-completeness column. ACM Trans. Algorithms 1(1), 160\u2013176 (2005)","journal-title":"ACM Trans. Algorithms"},{"issue":"6","key":"4_CR8","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1109\/TIT.1981.1056419","volume":"27","author":"SC Ntafos","year":"1981","unstructured":"Ntafos, S.C., Hakimi, S.L.: On the complexity of some coding problems. IEEE Trans. Inform. Theory 27(6), 794\u2013796 (1981)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02579206","volume":"7","author":"K Mulmuley","year":"1987","unstructured":"Mulmuley, K., Vazirani, U., Vazirani, V.: Matching is as easy as matrix inversion. Combinatorica 7, 105\u2013113 (1987)","journal-title":"Combinatorica"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1145\/322307.322309","volume":"29","author":"C Papadimitriou","year":"1982","unstructured":"Papadimitriou, C., Yannakakis, M.: The complexity of restricted spanning tree problems. J. ACM 29, 285\u2013309 (1982)","journal-title":"J. ACM"},{"issue":"4","key":"4_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1391289.1391291","volume":"55","author":"O Reingold","year":"2008","unstructured":"Reingold, O.: Undirected connectivity in log-space. J. ACM 55(4), 1\u201324 (2008)","journal-title":"J. ACM"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.641542","volume":"43","author":"A Vardy","year":"1997","unstructured":"Vardy, A.: The intractability of computing the minimum distance of a code. IEEE Trans. Inform. Theory 43, 1757\u20131766 (1997)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Vardy, A.: Algorithmic complexity in coding theory and the minimum distance problem. In: Proceeding of 29th ACM symposium on theory of computing, pp. 92\u2013109 (1997)","DOI":"10.1145\/258533.258559"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13524-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T18:57:40Z","timestamp":1559069860000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-13524-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319135236","9783319135243"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13524-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}