{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T12:54:59Z","timestamp":1779886499204,"version":"3.53.1"},"reference-count":27,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3485,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0304-3975(03)00401-8","type":"journal-article","created":{"date-parts":[[2003,8,12]],"date-time":"2003-08-12T17:57:44Z","timestamp":1060711064000},"page":"17-45","source":"Crossref","is-referenced-by-count":12,"title":["Inapproximability results for equations over finite groups"],"prefix":"10.1016","volume":"312","author":[{"given":"Lars","family":"Engebretsen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jonas","family":"Holmerin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Russell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(03)00401-8_BIB1","series-title":"The Probabilistic Method","author":"Alon","year":"2000"},{"issue":"3","key":"10.1016\/S0304-3975(03)00401-8_BIB2","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/278298.278306","article-title":"Proof verification and the hardness of approximation problems","volume":"45","author":"Arora","year":"1998","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(03)00401-8_BIB3","doi-asserted-by":"crossref","unstructured":"D.A.M. Barrington, P. McKenzie, C. Moore, P. Tesson, D. Th\u00e9rien, Equation satisfiability and program satisfiability for finite monoids, in: Proc. 25th Annu. Symp. on Mathematical Foundations of Computer Science, Bratislava, Slovak Republic, 2000, pp. 172\u2013181.","DOI":"10.1007\/3-540-44612-5_13"},{"issue":"2","key":"10.1016\/S0304-3975(03)00401-8_BIB4","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0890-5401(90)90007-5","article-title":"Non-uniform automata over groups","volume":"89","author":"Barrington","year":"1990","journal-title":"Inform. Comput."},{"issue":"4","key":"10.1016\/S0304-3975(03)00401-8_BIB5","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1145\/48014.63138","article-title":"Finite monoids and the fine structure of NC1","volume":"35","author":"Barrington","year":"1988","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/S0304-3975(03)00401-8_BIB6","doi-asserted-by":"crossref","first-page":"152","DOI":"10.4153\/CMB-1992-022-9","article-title":"The poset of conjugacy classes and decomposition of products in the symmetric group","volume":"35","author":"B\u00e9dard","year":"1992","journal-title":"Canad. Math. Bull."},{"issue":"3","key":"10.1016\/S0304-3975(03)00401-8_BIB7","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1137\/S0097539796302531","article-title":"Free bits, PCPs and non-approximability\u2014towards tight results","volume":"27","author":"Bellare","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(03)00401-8_BIB8","doi-asserted-by":"crossref","unstructured":"I. Dinur, S. Safra, The importance of being biased, in: Proc. 34th Annu. ACM Symp. on Theory of Computing, Montr\u00e9al, Queb\u00e9c, Canada, 2002, pp. 33\u201342.","DOI":"10.1145\/509914.509915"},{"key":"10.1016\/S0304-3975(03)00401-8_BIB9","article-title":"Fourier Series and Integrals","volume":"Vol. 14","author":"Dym","year":"1972"},{"key":"10.1016\/S0304-3975(03)00401-8_BIB10","series-title":"Proc. 5th Internat. Workshop on Randomization and Approximation Techniques in Computer Science","first-page":"241","article-title":"The non-approximability of non-Boolean predicates","volume":"Vol. 2129","author":"Engebretsen","year":"2001"},{"issue":"1\u20133","key":"10.1016\/S0304-3975(03)00401-8_BIB11","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1016\/S0304-3975(02)00535-2","article-title":"Towards optimal lower bounds for clique and chromatic number","volume":"299","author":"Engebretsen","year":"2003","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/S0304-3975(03)00401-8_BIB12","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","article-title":"A threshold of ln n for approximating set cover","volume":"45","author":"Feige","year":"1998","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/S0304-3975(03)00401-8_BIB13","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/0097-3165(78)90076-6","article-title":"On solutions of equations in symmetric groups","volume":"25","author":"Finkelstein","year":"1978","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0304-3975(03)00401-8_BIB14","doi-asserted-by":"crossref","unstructured":"M. Goldmann, A. Russell, The computational complexity of solving systems of equations over finite groups, in: Proc. 14th Annu. IEEE Conf. on Computational Complexity, Atlanta, GA, 1999, pp. 80\u201386.","DOI":"10.1109\/CCC.1999.766266"},{"key":"10.1016\/S0304-3975(03)00401-8_BIB15","doi-asserted-by":"crossref","unstructured":"V. Guruswami, J. H\u00e5stad, M. Sudan, Hardness of approximate hypergraph coloring, in: 41st Annu. Symp. on Foundations of Computer Science, IEEE, Redondo Beach, CA, 2000, pp. 149\u2013158.","DOI":"10.1109\/SFCS.2000.892074"},{"issue":"4","key":"10.1016\/S0304-3975(03)00401-8_BIB16","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1145\/502090.502098","article-title":"Some optimal inapproximability results","volume":"48","author":"H\u00e5stad","year":"2001","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(03)00401-8_BIB17","doi-asserted-by":"crossref","unstructured":"S. Khot, Improved inapproximability results for maxclique, chromatic number and approximate graph coloring, in: 42nd Annu. Symp. on Foundations of Computer Science, IEEE, Las Vegas, Nevada, 2001, pp. 600\u2013609.","DOI":"10.1109\/SFCS.2001.959936"},{"key":"10.1016\/S0304-3975(03)00401-8_BIB18","series-title":"Linear Algebra, Undergraduate Texts in Mathematics","author":"Lang","year":"1987"},{"issue":"3","key":"10.1016\/S0304-3975(03)00401-8_BIB19","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","article-title":"Optimization, approximation, and complexity classes","volume":"43","author":"Papadimitriou","year":"1991","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"10.1016\/S0304-3975(03)00401-8_BIB20","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1137\/S0097539795280895","article-title":"A parallel repetition theorem","volume":"27","author":"Raz","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(03)00401-8_BIB21","doi-asserted-by":"crossref","unstructured":"A. Samorodnitsky, L. Trevisan, A PCP characterization of NP with optimal amortized query complexity, in: Proc. Thirty-Second Annu. ACM Symp. on Theory of Computing, Portland, Oregon, 2000, pp. 191\u2013199.","DOI":"10.1145\/335305.335329"},{"key":"10.1016\/S0304-3975(03)00401-8_BIB22","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02242355","article-title":"Schnelle Multiplikation gro\u00dfer Zahlen","volume":"7","author":"Sch\u00f6nhage","year":"1971","journal-title":"Computing"},{"key":"10.1016\/S0304-3975(03)00401-8_BIB23","article-title":"Linear representations of finite groups","volume":"Vol. 42","author":"Serre","year":"1977"},{"key":"10.1016\/S0304-3975(03)00401-8_BIB24","article-title":"Enumerative Combinatorics, Vol. 2","volume":"Vol. 62","author":"Stanley","year":"1999"},{"issue":"6","key":"10.1016\/S0304-3975(03)00401-8_BIB25","first-page":"171","article-title":"K teorii uravnenij na kone\u010dnyh gruppah, Izvesti\u00e2 Rossijskoj Akademii Nauk","volume":"59","author":"Strunkov","year":"1995","journal-title":"Seri\u00e2 Matemati\u010deska\u00e2"},{"key":"10.1016\/S0304-3975(03)00401-8_BIB26","article-title":"Fourier analysis on finite groups and applications","volume":"Vol. 43","author":"Terras","year":"1999"},{"key":"10.1016\/S0304-3975(03)00401-8_BIB27","unstructured":"U. Zwick, Approximation algorithms for constraint satisfaction programs involving at most three variables per constraint, in: Proc. Ninth Annual ACM-SIAM Symp. on Discrete Algorithms, San Francisco, California, 1998, pp. 201\u2013210."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503004018?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503004018?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T14:18:12Z","timestamp":1734099492000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397503004018"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0304397503004018"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00401-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}