{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:36:27Z","timestamp":1725665787881},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642283314"},{"type":"electronic","value":"9783642283321"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28332-1_8","type":"book-chapter","created":{"date-parts":[[2012,2,29]],"date-time":"2012-02-29T14:45:36Z","timestamp":1330526736000},"page":"83-94","source":"Crossref","is-referenced-by-count":0,"title":["Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits"],"prefix":"10.1007","author":[{"given":"Vikraman","family":"Arvind","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yadu","family":"Vasudev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"8_CR1","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1137\/S0097539798343647","volume":"30","author":"M. Agrawal","year":"2000","unstructured":"Agrawal, M., Thierauf, T.: The formula isomorphism problem. SIAM Journal on Computing\u00a030(3), 990\u20131009 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1007\/978-3-642-15369-3_30","volume-title":"APPROX and RANDOM 2010","author":"N. Alon","year":"2010","unstructured":"Alon, N., Blais, E.: Testing Boolean Function Isomorphism. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX and RANDOM 2010. LNCS, vol.\u00a06302, pp. 394\u2013405. Springer, Heidelberg (2010)"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Babai, L., Codenotti, P.: Isomorphism of hypergraphs of low rank in moderately exponential time. In: 49th FOCS, pp. 667\u2013676. IEEE (2008)","DOI":"10.1109\/FOCS.2008.80"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Babai, L., Luks, E.M.: Canonical labeling of graphs. In: 15th STOC, pp. 171\u2013183. ACM (1983)","DOI":"10.1145\/800061.808746"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Blais, E., O\u2019Donnell, R.: Lower bounds for testing function isomorphism. In: 25th CCC, pp. 235\u2013246. IEEE Computer Society (2010)","DOI":"10.1109\/CCC.2010.30"},{"key":"8_CR6","unstructured":"Bunke, H.: Graph matching: Theoretical foundations, algorithms, and applications. In: Proceedings of Vision Interface, Montreal, Canada, pp. 82\u201388 (2000)"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Chakraborty, S., Garc\u00eda-Soriano, D., Matsliah, A.: Nearly tight bounds for testing function isomorphism. In: 22nd SODA, pp. 1683\u20131702. SIAM (2011)","DOI":"10.1137\/1.9781611973082.130"},{"issue":"3","key":"8_CR8","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1145\/174130.174138","volume":"40","author":"N. Linial","year":"1993","unstructured":"Linial, N., Mansour, Y., Nisan, N.: Constant depth circuits, fourier transform, and learnability. J. ACM\u00a040(3), 607\u2013620 (1993)","journal-title":"J. ACM"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Luks, E.M.: Hypergraph isomorphism and structural equivalence of boolean functions. In: 31st STOC, pp. 652\u2013658. ACM (1999)","DOI":"10.1145\/301250.301427"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28332-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T08:24:27Z","timestamp":1556439867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28332-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642283314","9783642283321"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28332-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}