{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:02:24Z","timestamp":1729652544569,"version":"3.28.0"},"reference-count":7,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ccc.2004.1313845","type":"proceedings-article","created":{"date-parts":[[2004,11,13]],"date-time":"2004-11-13T00:14:14Z","timestamp":1100304854000},"page":"215-222","source":"Crossref","is-referenced-by-count":2,"title":["Deterministic polynomial identity testing in non commutative models"],"prefix":"10.1109","author":[{"family":"Ran Raz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Shpilka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF01294256","article-title":"Lower bound on arithmetic circuits via partial derivatives","volume":"6","author":"nisan","year":"1996","journal-title":"Computational Complexity"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103462"},{"key":"1","article-title":"Derandomizmg polynomial identity tests means proving circuit lower bounds","author":"impagliazzo","year":"2003","journal-title":"STOC"},{"key":"7","first-page":"201","author":"waack","year":"1997","journal-title":"On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams"},{"key":"6","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","article-title":"Probabilistic algorithms for sparse polynomials","author":"zippel","year":"1979","journal-title":"Symbolic and Algebraic Computation (EUROSAM '79 Internat Sympos Marseille 1979)"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/PL00001609"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"}],"event":{"name":"Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.","location":"Amherst, MA, USA"},"container-title":["Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9188\/29139\/01313845.pdf?arnumber=1313845","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T11:52:47Z","timestamp":1497613967000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1313845\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":7,"URL":"https:\/\/doi.org\/10.1109\/ccc.2004.1313845","relation":{},"subject":[]}}