{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:41:41Z","timestamp":1750308101517,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":7,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,6,25]],"date-time":"2005-06-25T00:00:00Z","timestamp":1119657600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,6,25]]},"DOI":"10.1145\/1068009.1068282","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"1613-1618","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Finding needles in haystacks is harder with neutrality"],"prefix":"10.1145","author":[{"given":"M.","family":"Collins","sequence":"first","affiliation":[{"name":"Edinburgh University, Scotland"}]}],"member":"320","published-online":{"date-parts":[[2005,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"GECCO","author":"Collins M.","year":"2004","unstructured":"M. Collins . Counting Solutions in Reduced Boolean Parity 2004 . GECCO 2004 . M. Collins. Counting Solutions in Reduced Boolean Parity 2004. GECCO 2004."},{"key":"e_1_3_2_1_2_1","volume-title":"Monte Carlo Sampling and Counting Solutions in Reduced Boolean Parity","author":"Collins M.","year":"2004","unstructured":"M. Collins . Monte Carlo Sampling and Counting Solutions in Reduced Boolean Parity 2004 .EDI-INF-RR-0240. http:\/\/www.inf.ed.ac.uk\/publications\/report\/ M. Collins. Monte Carlo Sampling and Counting Solutions in Reduced Boolean Parity 2004.EDI-INF-RR-0240. http:\/\/www.inf.ed.ac.uk\/publications\/report\/"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"J. Miller. An empirical study of the efficiency of learning boolean functions using a Cartesian Genetic Programming approach R. Poli et al (Eds.) Proceedings of the Third European Conference on Genetic Programming. 2000. pp. 121--132.   J. Miller. An empirical study of the efficiency of learning boolean functions using a Cartesian Genetic Programming approach R. Poli et al (Eds.) Proceedings of the Third European Conference on Genetic Programming. 2000. pp. 121--132.","DOI":"10.1007\/978-3-540-46239-2_9"},{"volume-title":"Proceedings of EuroGP'2000","author":"Miller J.","key":"e_1_3_2_1_5_1","unstructured":"J. Miller . Cartesian Genetic Programming R. poli et al (Eds.) Genetic Programming , Proceedings of EuroGP'2000 J. Miller. Cartesian Genetic Programming R. poli et al (Eds.) Genetic Programming, Proceedings of EuroGP'2000"},{"key":"e_1_3_2_1_6_1","first-page":"295","volume-title":"Goodman (Ed.) 2001 Genetic and Evolutionary Computation Conference Late Breaking Papers","author":"Miller J.","unstructured":"J. Miller . What Bloat? Cartesian Genetic Programming on Boolean problems E. Goodman (Ed.) 2001 Genetic and Evolutionary Computation Conference Late Breaking Papers , pp 295 -- 302 . J. Miller. What Bloat? Cartesian Genetic Programming on Boolean problems E. Goodman (Ed.) 2001 Genetic and Evolutionary Computation Conference Late Breaking Papers, pp 295--302."},{"key":"e_1_3_2_1_7_1","first-page":"13","volume":"2278","author":"Yu T.","year":"2002","unstructured":"T. Yu . J. Miller . Finding Needles in Haystacks Is Not Hard with Neutrality J. Foster 2002 , LNCS 2278 , pp. 13 -- 25 . T. Yu. J. Miller. Finding Needles in Haystacks Is Not Hard with Neutrality J. Foster et al (Eds.) EuroGP 2002, LNCS 2278, pp. 13--25.","journal-title":"LNCS"},{"key":"e_1_3_2_1_8_1","volume-title":"Miller. Neutrality and the Evolvabilty of Boolean Function Landscapes Proceedings of the Fourth European Conference on Genetic Programming.","author":"Yu T.","year":"2001","unstructured":"T. Yu . J. Miller. Neutrality and the Evolvabilty of Boolean Function Landscapes Proceedings of the Fourth European Conference on Genetic Programming. 2001 . T. Yu. J. Miller. Neutrality and the Evolvabilty of Boolean Function Landscapes Proceedings of the Fourth European Conference on Genetic Programming. 2001."}],"event":{"name":"GECCO05: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Washington DC USA","acronym":"GECCO05"},"container-title":["Proceedings of the 7th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1068009.1068282","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1068009.1068282","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:03Z","timestamp":1750262883000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1068009.1068282"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6,25]]},"references-count":7,"alternative-id":["10.1145\/1068009.1068282","10.1145\/1068009"],"URL":"https:\/\/doi.org\/10.1145\/1068009.1068282","relation":{},"subject":[],"published":{"date-parts":[[2005,6,25]]},"assertion":[{"value":"2005-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}