{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:32:25Z","timestamp":1742913145027,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031203497"},{"type":"electronic","value":"9783031203503"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20350-3_24","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"293-304","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Parallel Complexity of\u00a0Constrained Read-Once Refutations in\u00a0UTVPI Constraint Systems"],"prefix":"10.1007","author":[{"given":"K.","family":"Subramani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Wojciechowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Anari, N., Vazirani, V.V.: Planar graph perfect matching is in NC. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 650\u2013661 (2017)","DOI":"10.1109\/FOCS.2018.00068"},{"key":"24_CR2","unstructured":"Anari, N., Vazirani, V.V.: Matching is as easy as the decision problem in the NC model. In 11th Innovations in Theoretical Computer Science Conference, ITCS. LIPIcs, vol. 151, pp. 54:1\u201354:25 (2020)"},{"key":"24_CR3","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press (2001)"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Duan, R., Pettie, S., Su, H.-H.: Scaling algorithms for weighted matching in general graphs. ACM Trans. Algorithms 14(1), 8:1\u20138:35 (2018)","DOI":"10.1145\/3155301"},{"key":"24_CR5","unstructured":"Edmonds, J.: An introduction to matching, 1967. Mimeographed notes. Engineering Summer Conference, University of Michigan, Ann Arbor, MI"},{"issue":"124","key":"24_CR6","first-page":"1","volume":"124","author":"G Farkas","year":"1902","unstructured":"Farkas, G.: \u00dcber die Theorie der Einfachen Ungleichungen. Journal f\u00fcr die Reine und Angewandte Mathematik 124(124), 1\u201327 (1902)","journal-title":"Journal f\u00fcr die Reine und Angewandte Mathematik"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Fenner, S., Gurjar, R., Thierauf, T.: Bipartite perfect matching is in quasi-nc. In: Proceedings of the Forty-eighth Annual ACM Symposium on Theory of Computing, STOC 2016, pp. 754\u2013763. ACM (2016)","DOI":"10.1145\/2897518.2897564"},{"issue":"2","key":"24_CR8","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1145\/321941.321942","volume":"23","author":"HN Gabow","year":"1976","unstructured":"Gabow, H.N.: An efficient implementation of Edmonds\u2019 algorithm for maximum matching on graphs. J. ACM 23(2), 221\u2013234 (1976)","journal-title":"J. ACM"},{"key":"24_CR9","unstructured":"Goldwasser, S., Grossman, O.: Bipartite perfect matching in pseudo-deterministic NC. In: 44th International Colloquium on Automata, Languages, and Programming (ICALP). LIPIcs, vol. 80, pp. 87:1\u201387:13 (2017)"},{"key":"24_CR10","unstructured":"Khan, M., et al.: Algorithms of Informatics. Mondat Kft. Budapest, September 2013"},{"key":"24_CR11","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization. Number 21 in Algorithms and Combinatorics, , 4th edn. Springer, New York (2010)"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"S. K. Lahiri and M. Musuvathi. An Efficient Decision Procedure for UTVPI Constraints. In Proceedings of the $$5^{th}$$ International Workshop on the Frontiers of Combining Systems, September 19\u201321, Vienna, Austria, pages 168\u2013183, New York, 2005. Springer","DOI":"10.1007\/11559306_9"},{"key":"24_CR13","unstructured":"Leighton, F.T.: Introduction to Parallel Algorithms and Architectures. Morgan Kaufmann (1992)"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Mulmuley, K., Vazirani, U.V., Vazirani, V.V.: Matching is as easy as matrix inversion. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC 1987, pp. 345\u2013354. . Association for Computing Machinery, New York (1987)","DOI":"10.1145\/28395.383347"},{"key":"24_CR15","volume-title":"Papadimitriou","author":"H Christos","year":"1994","unstructured":"Christos, H.: Papadimitriou. Computational Complexity. Addison-Wesley, New York (1994)"},{"key":"24_CR16","unstructured":"Sankowski, P.: NC Algorithms for Weighted Planar Perfect Matching and Related Problems. In: 45th International Colloquium on Automata, Languages, and Programming (ICALP). LIPIcs, vol. 107, pp. 97:1\u201397:16 (2018)"},{"key":"24_CR17","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1987","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley and Sons, New York (1987)"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Subramani, K., Wojciechowki, P.: A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints. Algorithmica 81(7), 2765\u20132794 (2019)","DOI":"10.1007\/s00453-019-00554-z"},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Subramani, K., Wojciechowski, P.J.: A combinatorial certifying algorithm for linear feasibility in UTVPI constraints. Algorithmica 78(1), 166\u2013208 (2017)","DOI":"10.1007\/s00453-016-0131-1"},{"issue":"2","key":"24_CR20","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10878-017-0176-3","volume":"35","author":"K Subramani","year":"2018","unstructured":"Subramani, K., Wojciechowski, P.J.: A certifying algorithm for lattice point feasibility in a system of UTVPI constraints. J. Comb. Optim. 35(2), 389\u2013408 (2018)","journal-title":"J. Comb. Optim."},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Svensson, O., Tarnawski, J.: The matching problem in general graphs is in quasi-NC. In: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pp. 696\u2013707 (2017)","DOI":"10.1109\/FOCS.2017.70"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20350-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:25:39Z","timestamp":1672550739000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20350-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031203497","9783031203503"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20350-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lxy.tjut.edu.cn\/TAMC2022.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}