乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T17:11:58Z","timestamp":1730221918386,"version":"3.28.0"},"reference-count":47,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T00:00:00Z","timestamp":1699228800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T00:00:00Z","timestamp":1699228800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000288","name":"Royal Society","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000288","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,11,6]]},"DOI":"10.1109\/focs57990.2023.00074","type":"proceedings-article","created":{"date-parts":[[2023,12,22]],"date-time":"2023-12-22T19:20:35Z","timestamp":1703272835000},"page":"1261-1270","source":"Crossref","is-referenced-by-count":2,"title":["Polynomial-Time Pseudodeterministic Construction of Primes"],"prefix":"10.1109","author":[{"given":"Lijie","family":"Chen","sequence":"first","affiliation":[{"name":"UC Berkeley,Berkeley,CA,USA"}]},{"given":"Zhenjian","family":"Lu","sequence":"additional","affiliation":[{"name":"University of Oxford,Oxford,UK"}]},{"given":"Igor C.","family":"Oliveira","sequence":"additional","affiliation":[{"name":"University of Warwick,Coventry,UK"}]},{"given":"Hanlin","family":"Ren","sequence":"additional","affiliation":[{"name":"University of Oxford,Oxford,UK"}]},{"given":"Rahul","family":"Santhanam","sequence":"additional","affiliation":[{"name":"University of Oxford,Oxford,UK"}]}],"member":"263","reference":[{"key":"ref1","first-page":"136","article-title":"Probabilistic search algorithms with unique answers and their cryptographic applications","volume-title":"Electronic Colloquium on Computational Complexity (ECCC)","volume":"18","author":"Gat","year":"2011"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055500"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/focs52979.2021.00021"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1059513.1059516"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.4064\/aa-2-1-23-46"},{"issue":"2","key":"ref6","doi-asserted-by":"crossref","first-page":"781","DOI":"10.4007\/annals.2004.160.781","article-title":"PRIMES is in P","volume":"160","author":"Agrawal","year":"2004","journal-title":"Annals of Mathematics"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258590"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/83.3.532"},{"key":"ref9","first-page":"1180","article-title":"3. 1 n-quad o(n) circuit lower bounds for explicit functions","author":"Li","year":"2022","journal-title":"STOC"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(87)90037-x"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1090\/s0025-5718-2011-02542-1"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422453"},{"first-page":"36:1","article-title":"On the pseudo-deterministic query complexity of NP search problems","volume-title":"Computational Complexity Conference (CCC)","author":"Goldwasser","key":"ref13"},{"article-title":"Query complexity of search problems","volume-title":"Electronic Colloquium on Computational Complexity (ECCC)","year":"2023","author":"Chattopadhyay","key":"ref14"},{"key":"ref15","first-page":"79:1","article-title":"Pseudo-deterministic streaming","author":"Goldwasser","year":"2020","journal-title":"Innovations in Theoretical Computer Science (ITCS)"},{"key":"ref16","article-title":"Lower bounds for pseudo-deterministic counting in a stream","volume":"abs\/2303.16287","author":"Braverman","year":"2023","journal-title":"CoRR"},{"key":"ref17","first-page":"87:1","article-title":"Bipartite perfect matching in pseudo-deterministic NC","author":"Goldwasser","year":"2017","journal-title":"International Colloquium on Automata, Languages, and Programming (ICALP)"},{"key":"ref18","first-page":"41:1","article-title":"Matroid intersection: A pseudo-deterministic parallel reduction from search to weighted-decision","author":"Ghosh","year":"2021","journal-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM)"},{"first-page":"55:1","article-title":"Pseudo-derandomizing learning and approximation","volume-title":"International Conference on Randomization and Computation (RANDOM)","author":"Oliveira","key":"ref19"},{"key":"ref20","first-page":"32:1","article-title":"Randomness and intractability in Kolmogorov complexity","author":"Oliveira","year":"2019","journal-title":"International Colloquium on Automata, Languages, and Programming (ICALP)"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451085"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.38"},{"key":"ref23","first-page":"17:1","article-title":"Pseudo-deterministic proofs","author":"Goldwasser","year":"2018","journal-title":"Innovations in Theoretical Computer Science, (ITCS)"},{"key":"ref24","first-page":"135","article-title":"Doubly-efficient pseudo-deterministic proofs","volume-title":"Electronic Colloquium on Computational Complexity (ECCC)","volume":"26","author":"Goemans","year":"2019"},{"key":"ref25","first-page":"207","article-title":"Finding primitive roots pseudo-deterministically","volume-title":"Electronic Colloquium on Computational Complexity (ECCC)","volume":"22","author":"Grossman","year":"2015"},{"first-page":"61:1","article-title":"On pseudodeterministic approximation algorithms","volume-title":"Symposium on Mathematical Foundations of Computer Science (MFCS)","author":"Dixon","key":"ref26"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-98113-0_16"},{"key":"ref28","first-page":"12","article-title":"Multi-pseudodeterministic algorithms","volume-title":"Electronic Colloquium on Computational Complexity (ECCC)","volume":"26","author":"Goldreich","year":"2019"},{"journal-title":"Innovations in Theoretical Computer Science (ITCS)","article-title":"Complete problems for multi-pseudodeterministic computations","year":"2021","author":"Dixon","key":"ref29"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520043"},{"key":"ref31","article-title":"The geometry of rounding","volume-title":"Electronic Colloquium on Computational Complexity (ECCC)","volume":"TR22-160","author":"Woude","year":"2022"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-31371-4_22"},{"key":"ref33","article-title":"Theory and applications of probabilistic Kolmogorov complexity","volume":"137","author":"Lu","year":"2022","journal-title":"Bull. EATCS"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1780"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-007-0233-x"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/800141.804678"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/s0019-9958(82)90382-5"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/s0022-0000(02)00024-7"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48686-0_21"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/s0022-0000(05)80043-1"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/focs54457.2022.00048"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/2699436"},{"key":"ref43","first-page":"101","article-title":"On the doubly-efficient interactive proof systems of GKR","volume-title":"Electronic Colloquium on Computational Complexity (ECCC)","volume":"24","author":"Goldreich","year":"2017"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1730"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1992-1106981-9"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/0213053"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/sfcs.1982.45"}],"event":{"name":"2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)","start":{"date-parts":[[2023,11,6]]},"location":"Santa Cruz, CA, USA","end":{"date-parts":[[2023,11,9]]}},"container-title":["2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10353068\/10353072\/10353148.pdf?arnumber=10353148","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T23:10:57Z","timestamp":1705101057000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10353148\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,6]]},"references-count":47,"URL":"https:\/\/doi.org\/10.1109\/focs57990.2023.00074","relation":{},"subject":[],"published":{"date-parts":[[2023,11,6]]}}}