{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:17:32Z","timestamp":1763468252583,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476710"},{"type":"electronic","value":"9783662476727"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47672-7_19","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T10:07:39Z","timestamp":1434708459000},"page":"231-242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Bj\u00f6rklund","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Holger","family":"Dell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thore","family":"Husfeldt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511804090"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Husfeldt, T.: The parity of directed hamiltonian cycles. In: Proc. 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS, Berkeley, CA, USA, October 26\u201329, pp. 727\u2013735 (2013)","DOI":"10.1109\/FOCS.2013.83"},{"key":"19_CR3","unstructured":"Bj\u00f6rklund, A.: Below all subsets for permutational counting problems, (2012) arXiv:1211.0391 [cs:DS]"},{"issue":"1","key":"19_CR4","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1137\/110839229","volume":"43","author":"A Bj\u00f6rklund","year":"2014","unstructured":"Bj\u00f6rklund, A.: Determinant sums for undirected Hamiltonicity. SIAM J. Comput. 43(1), 280\u2013299 (2014)","journal-title":"SIAM J. Comput."},{"key":"19_CR5","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Lyckberg, I.: Computing the permanent modulo a prime power. In: preparation (2015)"},{"key":"19_CR6","unstructured":"Calabro, C., Impagliazzo, R., Kabanets, V., Paturi, R.: The complexity of unique k-SAT: An isolation lemma for k-CNFs. In: Proc. 18th IEEE Conference on Computational Complexity, CCC, Aarhus, Denmark, July 7\u201310 (2003)"},{"key":"19_CR7","unstructured":"Cohen, G., Tal, A.: Two structural results for low degree polynomials and applications. Electronic Colloquium on Computational Complexity (ECCC). Tech report TR13-145 (2013)"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Cygan, M., Kratsch, S., Nederlof, J.: Fast Hamiltonicity checking via bases of perfect matchings. In: Proc. 45th Symposium on Theory of Computing, STOC, Palo Alto, CA, USA, June 1\u20134, pp. 301\u2013310 (2013)","DOI":"10.1145\/2488608.2488646"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Cygan, M., Dell, H., Lokshtanov, D., Marx, D., Nederlof, J., Okamoto, Y., Paturi, R., Saurabh, S., Wahlstr\u00f6m, M.: On problems as hard as CNFSAT. In: Proc. 27th IEEE Conference on Computational Complexity, CCC, Porto, Portugal, June 26\u201384 (2012)","DOI":"10.1109\/CCC.2012.36"},{"key":"19_CR10","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)"},{"issue":"1","key":"19_CR11","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s002240000075","volume":"31","author":"S Gupta","year":"1998","unstructured":"Gupta, S.: Isolating an odd number of elements and applications in complexity theory. Theor. Comput. Syst. 31(1), 27\u201340 (1998)","journal-title":"Theor. Comput. Syst."},{"issue":"2","key":"19_CR12","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s00224-011-9381-0","volume":"52","author":"JA Montoya","year":"2013","unstructured":"Montoya, J.A., M\u00fcller, M.: Parameterized random complexity. Theor. Comput. Syst. 52(2), 221\u2013270 (2013)","journal-title":"Theor. Comput. Syst."},{"issue":"1","key":"19_CR13","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02579206","volume":"7","author":"K Mulmuley","year":"1987","unstructured":"Mulmuley, K., Vazirani, U.V., Vazirani, V.V.: Matching is as easy as matrix inversion. Combinatorica 7(1), 105\u2013113 (1987)","journal-title":"Combinatorica"},{"issue":"5","key":"19_CR14","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1137\/0220053","volume":"20","author":"S Toda","year":"1991","unstructured":"Toda, S.: PP is as hard as the polynomial-time hierarchy. SIAM J. Comput. 20(5), 865\u2013877 (1991)","journal-title":"SIAM J. Comput."},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-540-79723-4_18","volume-title":"Parameterized and Exact Computation","author":"P Traxler","year":"2008","unstructured":"Traxler, P.: The time complexity of constraint satisfaction. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol. 5018, pp. 190\u2013201. Springer, Heidelberg (2008)"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(86)90135-0","volume":"47","author":"LG Valiant","year":"1986","unstructured":"Valiant, L.G., Vazirani, V.V.: NP is as easy as detecting unique solutions. Theor. Comput. Sci. 47, 85\u201393 (1986)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR17","unstructured":"Williams, V.V., Wang, J., Williams, R., Yu, H.: Finding four-node subgraphs in triangle time. In: Proc. 26th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, San Diego, CA, USA, January 4\u20136, 2015, pp. 1671\u20131680 (2015)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47672-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T02:12:58Z","timestamp":1676945578000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47672-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476710","9783662476727"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47672-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}