乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T06:33:38Z","timestamp":1724135618885},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,19]]},"DOI":"10.1145\/3055399.3055457","type":"proceedings-article","created":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T20:27:45Z","timestamp":1497558465000},"update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Real stable polynomials and matroids: optimization and counting"],"prefix":"10.1145","author":[{"given":"Damian","family":"Straszak","sequence":"first","affiliation":[{"name":"EPFL, Switzerland"}]},{"given":"Nisheeth K.","family":"Vishnoi","sequence":"additional","affiliation":[{"name":"EPFL, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2017,6,19]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Proceedings of the 2017 ACM Conference on Innovations in Theoretical Computer Science.","author":"Anari Nima","year":"2017","unstructured":"Nima Anari , Shayan Oveis Gharan , Amin Saberi , and Mohit Singh . 2017 . Nash Social Welfare, Matrix Permanent, and Stable Polynomials . In Proceedings of the 2017 ACM Conference on Innovations in Theoretical Computer Science. Nima Anari, Shayan Oveis Gharan, Amin Saberi, and Mohit Singh. 2017. Nash Social Welfare, Matrix Permanent, and Stable Polynomials. In Proceedings of the 2017 ACM Conference on Innovations in Theoretical Computer Science."},{"key":"e_1_3_2_2_2_1","volume-title":"The Lee-Yang and P\u00f3lya-Schur programs. I. linear operators preserving stability. Inventiones mathematicae 177, 3","author":"Borcea Julius","year":"2009","unstructured":"Julius Borcea and Petter Br\u00e4nd\u00e9n . 2009. The Lee-Yang and P\u00f3lya-Schur programs. I. linear operators preserving stability. Inventiones mathematicae 177, 3 ( 2009 ), 541\u2013569. Julius Borcea and Petter Br\u00e4nd\u00e9n. 2009. The Lee-Yang and P\u00f3lya-Schur programs. I. linear operators preserving stability. Inventiones mathematicae 177, 3 (2009), 541\u2013569."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20295"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-08-00618-8"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480191222926"},{"key":"e_1_3_2_2_6_1","unstructured":"Petter Branden. 2007. Petter Branden. 2007."},{"key":"e_1_3_2_2_7_1","volume-title":"Advances in Mathematics 216, 1","author":"Polynomials","year":"2007","unstructured":"Polynomials with the half-plane property and matroid theory. Advances in Mathematics 216, 1 ( 2007 ), 302 \u2013 320. Polynomials with the half-plane property and matroid theory. Advances in Mathematics 216, 1 (2007), 302 \u2013 320."},{"key":"e_1_3_2_2_8_1","volume-title":"Vishnoi","author":"Celis L. Elisa","year":"2016","unstructured":"L. Elisa Celis , Amit Deshpande , Tarun Kathuria , Damian Straszak , and Nisheeth K . Vishnoi . 2016 . On the Complexity of Constrained Determinantal Point Processes. ArXiv e-prints (Aug. 2016). arXiv:cs.DS\/1608.00554 L. Elisa Celis, Amit Deshpande, Tarun Kathuria, Damian Straszak, and Nisheeth K. Vishnoi. 2016. On the Complexity of Constrained Determinantal Point Processes. ArXiv e-prints (Aug. 2016). arXiv:cs.DS\/1608.00554"},{"key":"e_1_3_2_2_9_1","volume-title":"Vishnoi","author":"Celis L. Elisa","year":"2016","unstructured":"L. Elisa Celis , Amit Deshpande , Tarun Kathuria , and Nisheeth K . Vishnoi . 2016 . L. Elisa Celis, Amit Deshpande, Tarun Kathuria, and Nisheeth K. Vishnoi. 2016."},{"key":"e_1_3_2_2_10_1","unstructured":"How to be fair and diverse? Fairness Accountability and Transparency in Machine Learning (2016). How to be fair and diverse? Fairness Accountability and Transparency in Machine Learning (2016)."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548306007541"},{"key":"e_1_3_2_2_12_1","volume-title":"Wagner","author":"Choe Young-Bin","year":"2004","unstructured":"Young-Bin Choe , James G. Oxley , Alan D. Sokal , and David G . Wagner . 2004 . Young-Bin Choe, James G. Oxley, Alan D. Sokal, and David G. Wagner. 2004."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-8858(03)00078-2"},{"key":"e_1_3_2_2_14_1","unstructured":"A. Deshpande and L. Rademacher. 2010. A. Deshpande and L. Rademacher. 2010."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.38"},{"key":"e_1_3_2_2_16_1","unstructured":"Leonid Gurvits. 2004. Leonid Gurvits. 2004."},{"key":"e_1_3_2_2_17_1","volume-title":"arXiv preprint math\/0404474","author":"Combinatorial","year":"2004","unstructured":"Combinatorial and algorithmic aspects of hyperbolic polynomials. arXiv preprint math\/0404474 ( 2004 ). Combinatorial and algorithmic aspects of hyperbolic polynomials. arXiv preprint math\/0404474 (2004)."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Leonid Gurvits. 2006. Leonid Gurvits. 2006.","DOI":"10.1016\/S1773-035X(06)80106-1"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1995.1005"},{"key":"e_1_3_2_2_20_1","unstructured":"Alex Kulesza and Ben Taskar. 2012. Alex Kulesza and Ben Taskar. 2012."},{"key":"e_1_3_2_2_21_1","volume-title":"Now Publishers Inc","author":"Machine Learning Determinantal Point","unstructured":"Determinantal Point Processes for Machine Learning . Now Publishers Inc ., Hanover, MA, USA . Determinantal Point Processes for Machine Learning. Now Publishers Inc., Hanover, MA, USA."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2015.182.1.8"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746628"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897649"},{"key":"e_1_3_2_2_25_1","unstructured":"James G Oxley. 2006. James G Oxley. 2006."},{"key":"e_1_3_2_2_26_1","unstructured":"Matroid theory. Vol. 3. Oxford University Press USA. Matroid theory. Vol. 3. Oxford University Press USA."},{"key":"e_1_3_2_2_27_1","volume-title":"Hyperbolicity and stable polynomials in combinatorics and probability. arXiv preprint arXiv:1210.3231","author":"Pemantle Robin","year":"2012","unstructured":"Robin Pemantle . 2012. Hyperbolicity and stable polynomials in combinatorics and probability. arXiv preprint arXiv:1210.3231 ( 2012 ). Robin Pemantle. 2012. Hyperbolicity and stable polynomials in combinatorics and probability. arXiv preprint arXiv:1210.3231 (2012)."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591803"},{"key":"e_1_3_2_2_29_1","unstructured":"Marco Di Summa Friedrich Eisenbrand Yuri Faenza and Carsten Moldenhauer. 2015. Marco Di Summa Friedrich Eisenbrand Yuri Faenza and Carsten Moldenhauer. 2015."},{"key":"e_1_3_2_2_30_1","volume-title":"Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 315\u2013323","author":"On","unstructured":"On largest volume simplices and sub-determinants . In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 315\u2013323 . On largest volume simplices and sub-determinants. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 315\u2013323."},{"key":"e_1_3_2_2_31_1","volume-title":"FOCS 2013 Workshop on Zeros of Polynomials and their Applications to Theory. 1\u201318","author":"Vishnoi Nisheeth K","year":"2013","unstructured":"Nisheeth K Vishnoi . 2013 . Zeros of polynomials and their applications to theory: a primer . In FOCS 2013 Workshop on Zeros of Polynomials and their Applications to Theory. 1\u201318 . Nisheeth K Vishnoi. 2013. Zeros of polynomials and their applications to theory: a primer. In FOCS 2013 Workshop on Zeros of Polynomials and their Applications to Theory. 1\u201318."}],"event":{"name":"STOC '17: Symposium on Theory of Computing","location":"Montreal Canada","acronym":"STOC '17","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055457","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T17:21:17Z","timestamp":1673198477000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055457"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,19]]},"references-count":31,"alternative-id":["10.1145\/3055399.3055457","10.1145\/3055399"],"URL":"https:\/\/doi.org\/10.1145\/3055399.3055457","relation":{},"subject":[],"published":{"date-parts":[[2017,6,19]]},"assertion":[{"value":"2017-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}