{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T00:04:31Z","timestamp":1759709071690,"version":"build-2065373602"},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2023,12,24]],"date-time":"2023-12-24T00:00:00Z","timestamp":1703376000000},"content-version":"vor","delay-in-days":1484,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004350","name":"Studienstiftung des Deutschen Volkes","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004350","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1016\/j.tcs.2019.09.052","type":"journal-article","created":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T11:25:49Z","timestamp":1569929149000},"page":"124-139","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Balance problems for integer circuits"],"prefix":"10.1016","volume":"799","author":[{"given":"Titus","family":"Dose","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2019.09.052_br0010","series-title":"42nd International Symposium on Mathematical Foundations of Computer Science","article-title":"Emptiness problems for integer circuits","author":"Barth","year":"2017"},{"key":"10.1016\/j.tcs.2019.09.052_br0020","series-title":"Fundamentals of Computation Theory, Proceedings of the 16th International Symposium","first-page":"125","article-title":"The complexity of membership problems for circuits over sets of positive numbers","author":"Breunig","year":"2007"},{"key":"10.1016\/j.tcs.2019.09.052_br0030","series-title":"Proceedings of the 3rd Annual ACM Symposium on Theory of Computing","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/j.tcs.2019.09.052_br0040","series-title":"41st International Symposium on Mathematical Foundations of Computer Science","article-title":"Complexity of constraint satisfaction problems over finite subsets of natural numbers","author":"Dose","year":"2016"},{"issue":"2","key":"10.1016\/j.tcs.2019.09.052_br0050","doi-asserted-by":"crossref","first-page":"425","DOI":"10.2307\/1970289","article-title":"The decision problem for exponential Diophantine equations","volume":"74","author":"Davis","year":"1961","journal-title":"Ann. Math."},{"key":"10.1016\/j.tcs.2019.09.052_br0060","series-title":"Anatomy of Integers","first-page":"65","article-title":"Integers with a divisor in (y,2y]","volume":"vol. 46","author":"Ford","year":"2008"},{"key":"10.1016\/j.tcs.2019.09.052_br0070","doi-asserted-by":"crossref","first-page":"367","DOI":"10.4007\/annals.2008.168.367","article-title":"The distribution of integers with a divisor in a given interval","volume":"168","author":"Ford","year":"2008","journal-title":"Ann. Math. (2)"},{"issue":"1","key":"10.1016\/j.tcs.2019.09.052_br0080","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/s00224-008-9144-8","article-title":"Equivalence problems for circuits over sets of natural numbers","volume":"46","author":"Gla\u00dfer","year":"2010","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.tcs.2019.09.052_br0090","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.tcs.2017.08.025","article-title":"Circuit satisfiability and constraint satisfaction around Skolem arithmetic","volume":"703","author":"Gla\u00dfer","year":"2017","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2019.09.052_br0100","series-title":"Proceedings: Fifth Annual Structure in Complexity Theory Conference","first-page":"140","article-title":"A survey on counting classes","author":"Gundermann","year":"1990"},{"issue":"13","key":"10.1016\/j.tcs.2019.09.052_br0110","doi-asserted-by":"crossref","first-page":"1394","DOI":"10.1016\/j.dam.2010.04.001","article-title":"Satisfiability of algebraic circuits over sets of natural numbers","volume":"158","author":"Gla\u00dfer","year":"2010","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2019.09.052_br0120","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1515\/crelle-2012-0064","article-title":"On the number of integers in a generalized multiplication table","volume":"689","author":"Koukoulopoulos","year":"2014","journal-title":"J. Reine Angew. Math."},{"key":"10.1016\/j.tcs.2019.09.052_br0130","first-page":"279","article-title":"Enumerable sets are Diophantine","volume":"191","author":"Matiyasevich","year":"1970","journal-title":"Dokl. Akad. Nauk SSSR"},{"issue":"3","key":"10.1016\/j.tcs.2019.09.052_br0140","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s00037-007-0229-6","article-title":"The complexity of membership problems for circuits over sets of natural numbers","volume":"16","author":"McKenzie","year":"2007","journal-title":"Comput. Complex."},{"year":"1994","series-title":"Computational Complexity","author":"Papadimitriou","key":"10.1016\/j.tcs.2019.09.052_br0150"},{"key":"10.1016\/j.tcs.2019.09.052_br0160","series-title":"Mathematical Theory and Computational Practice, Proceedings of the 5th Conference on Computability in Europe","first-page":"409","article-title":"Functions definable by arithmetic circuits","author":"Pratt-Hartmann","year":"2009"},{"key":"10.1016\/j.tcs.2019.09.052_br0170","series-title":"Proceedings of the 5th Annual ACM Symposium on Theory of Computing","first-page":"1","article-title":"Word problems requiring exponential time: preliminary report","author":"Stockmeyer","year":"1973"},{"issue":"1\u20133","key":"10.1016\/j.tcs.2019.09.052_br0180","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.tcs.2006.08.017","article-title":"The complexity of membership problems for circuits over sets of integers","volume":"369","author":"Travers","year":"2006","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2019.09.052_br0190","series-title":"Mathematical Foundations of Computer Science 1984, Proceedings","first-page":"544","article-title":"The complexity of problems concerning graphs with regularities (extended abstract)","author":"Wagner","year":"1984"},{"issue":"2","key":"10.1016\/j.tcs.2019.09.052_br0200","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1006\/jcss.2001.1768","article-title":"Integer circuit evaluation is pspace-complete","volume":"63","author":"Yang","year":"2001","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439751930622X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439751930622X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T01:00:02Z","timestamp":1759626002000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439751930622X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":20,"alternative-id":["S030439751930622X"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2019.09.052","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2019,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Balance problems for integer circuits","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2019.09.052","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}