乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T02:59:36Z","timestamp":1729652376186,"version":"3.28.0"},"reference-count":61,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/ccc.2014.34","type":"proceedings-article","created":{"date-parts":[[2014,8,20]],"date-time":"2014-08-20T19:19:59Z","timestamp":1408562399000},"page":"262-273","source":"Crossref","is-referenced-by-count":16,"title":["Mining Circuit Lower Bound Proofs for Meta-algorithms"],"prefix":"10.1109","author":[{"given":"Ruiwen","family":"Chen","sequence":"first","affiliation":[]},{"given":"Valentine","family":"Kabanets","sequence":"additional","affiliation":[]},{"given":"Antonina","family":"Kolokolova","sequence":"additional","affiliation":[]},{"given":"Ronen","family":"Shaltiel","sequence":"additional","affiliation":[]},{"given":"David","family":"Zuckerman","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"35","first-page":"265","article-title":"Universal sorting problems","volume":"9","author":"levin","year":"1973","journal-title":"Problems of Information Transmission"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1145\/174130.174138"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488630"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.69"},{"key":"39","article-title":"Some NP-complete set covering problems","author":"masek","year":"1979","journal-title":"Manuscript"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(75)90058-8"},{"key":"38","first-page":"23","article-title":"On the synthesis of switching circuits","volume":"119","author":"lupanov","year":"1958","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"43","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2009.36"},{"key":"42","doi-asserted-by":"publisher","DOI":"10.1007\/BF01768483"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21916"},{"key":"40","first-page":"765","article-title":"On a boolean function","volume":"169","author":"nechiporuk","year":"1966","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"23","first-page":"237","article-title":"Testing polynomials which are easy to compute","volume":"30","author":"heintz","year":"1982","journal-title":"L? Ens Math"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(02)00024-7"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.77"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.78"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258590"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(74)80044-9"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24508-4"},{"key":"3","first-page":"70","article-title":"On a method of obtaining more than quadratic effective lower bounds for the complexity of ?-schemes","volume":"42","author":"andreev","year":"1987","journal-title":"Vest Moskov Univer Mat"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1137\/060664537"},{"key":"1","first-page":"92","article-title":"Proving lower bounds via pseudo-random generators","author":"agrawal","year":"2005","journal-title":"FSTTCS"},{"key":"7","article-title":"On some relationships between monotone and non-monotone circuit complexity","author":"berkowitz","year":"1982","journal-title":"Technical Report UOFT"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335314"},{"key":"6","first-page":"117","article-title":"Approximating AC0 by small height decision trees and a deterministic algorithm for #AC0SAT","author":"beame","year":"2012","journal-title":"CCC"},{"key":"5","article-title":"A switching lemma primer","author":"beame","year":"1994","journal-title":"Technical Report UW CSE"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(82)90382-5"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48523-6_15"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-004-0182-6"},{"key":"9","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1145\/1754399.1754401","article-title":"Polylogarithmic independence fools AC0 circuits","volume":"57","author":"braverman","year":"2010","journal-title":"JACM"},{"key":"8","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1137\/0213053","article-title":"How to generate cryptographically strong sequences of pseudo-random bits","volume":"13","author":"blum","year":"1984","journal-title":"SICOMP"},{"key":"59","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.45"},{"key":"58","first-page":"44","article-title":"On the impossibility of elim inating perebor in solving some problems of circuit theory","volume":"124","author":"yablonski","year":"1959","journal-title":"DAN SSSR"},{"key":"57","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488612"},{"key":"56","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2011.36"},{"key":"19","first-page":"588","article-title":"Learning and lower bounds for AC0 with threshold gates","author":"gopalan","year":"2010","journal-title":"APPROX-RANDOM"},{"key":"55","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806723"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/11672142_38"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1007\/BF01744431"},{"key":"15","first-page":"403","article-title":"Worst-case upper bounds","author":"dantsin","year":"2009","journal-title":"Handbook of Satisfiability"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2008.07.007"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.3.233"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"11","article-title":"Mining circuit lower bound proofs for metaalgorithms","volume":"20","author":"chen","year":"2013","journal-title":"ECC"},{"key":"12","article-title":"An improved deterministic #SAT algorithm for small de M organ formulas","volume":"20","author":"chen","year":"2013","journal-title":"ECC"},{"key":"21","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1137\/S0097539794261556","article-title":"The shrinkage exponent of de morgan formulae is 2","volume":"27","author":"ha?stad","year":"1998","journal-title":"SICOMP"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12132"},{"key":"60","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.49"},{"key":"61","article-title":"Circuits, CNFs, and satisfiability","author":"zane","year":"1998","journal-title":"UCSD"},{"key":"49","article-title":"A large lower bound for 1-branching programs","author":"savicky","year":"1996","journal-title":"ECC"},{"key":"48","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.25"},{"key":"45","first-page":"344","article-title":"Bounded arithmetic and lower bounds in boolean complexity","author":"razborov","year":"1993","journal-title":"Feasible Mathematics II Birkhauser"},{"key":"44","doi-asserted-by":"publisher","DOI":"10.1007\/BF01137685"},{"key":"47","first-page":"87","article-title":"On the realization of monotone boolean functions by contact circuits","volume":"35","author":"redkin","year":"1979","journal-title":"Problemy Kibernetiki"},{"key":"46","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1494"},{"key":"10","first-page":"75","article-title":"The complexity of satisfiability of small depth circuits","author":"calabro","year":"2009","journal-title":"IWPEC"},{"key":"51","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28404"},{"key":"52","first-page":"553","article-title":"Realizations of linear function by formulas using V","volume":"136","author":"subbotovskaya","year":"1961","journal-title":"DAN SSSR"},{"key":"53","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1730"},{"key":"54","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.59"},{"key":"50","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2012.29"}],"event":{"name":"2014 IEEE Conference on Computational Complexity (CCC)","start":{"date-parts":[[2014,6,11]]},"location":"Vancouver, BC, Canada","end":{"date-parts":[[2014,6,13]]}},"container-title":["2014 IEEE 29th Conference on Computational Complexity (CCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6875457\/6875460\/06875495.pdf?arnumber=6875495","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T19:03:18Z","timestamp":1498158198000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6875495\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":61,"URL":"https:\/\/doi.org\/10.1109\/ccc.2014.34","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]}}}