{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:49:27Z","timestamp":1725511767076},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709176"},{"type":"electronic","value":"9783540709183"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70918-3_42","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T23:41:23Z","timestamp":1179963683000},"page":"489-499","source":"Crossref","is-referenced-by-count":2,"title":["The Polynomially Bounded Perfect Matching Problem Is in NC 2"],"prefix":"10.1007","author":[{"given":"Manindra","family":"Agrawal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thanh Minh","family":"Hoang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Thierauf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s000370050023","volume":"8","author":"E. Allender","year":"1999","unstructured":"Allender, E., Beals, R., Ogihara, M.: The complexity of matrix rank and feasible systems of linear equations. Computational Complexity\u00a08, 99\u2013126 (1999)","journal-title":"Computational Complexity"},{"key":"42_CR2","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1006\/jcss.1999.1646","volume":"59","author":"E. Allender","year":"1999","unstructured":"Allender, E., Reinhardt, K., Zhou, S.: Isolating, matching, and counting: uniform and nonuniform upper bounds. Journal of Computer and System Sciences\u00a059, 164\u2013181 (1999)","journal-title":"Journal of Computer and System Sciences"},{"key":"42_CR3","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0020-0190(84)90018-8","volume":"18","author":"S. Berkowitz","year":"1984","unstructured":"Berkowitz, S.: On computing the determinant in small parallel time using a small number of processors. Information Processing Letters\u00a018, 147\u2013150 (1984)","journal-title":"Information Processing Letters"},{"key":"42_CR4","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1051\/ita:2001119","volume":"35","author":"A. Chiu","year":"2001","unstructured":"Chiu, A., Davida, G., Litow, B.: Division in logspace-uniform NC 1. RAIRO Theoretical Informatics and Applications\u00a035, 259\u2013276 (2001)","journal-title":"RAIRO Theoretical Informatics and Applications"},{"key":"42_CR5","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","volume":"64","author":"S. Cook","year":"1985","unstructured":"Cook, S.: A taxonomy of problems with fast parallel algorithms. Information and Control\u00a064, 2\u201322 (1985)","journal-title":"Information and Control"},{"key":"42_CR6","unstructured":"Damm, C.: DET = L(#L). Technical Report Informatik-Preprint 8, Fachbereich Informatik der Humboldt-Universit\u00e4t zu Berlin (1991)"},{"key":"42_CR7","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jagm.1993.1046","volume":"15","author":"E. Dahlhaus","year":"1993","unstructured":"Dahlhaus, E., Hajnal, P., Karpinski, M.: On the parallel complexity of hamiltonian cycles and matching problem in dense graphs. Journal of Algorithms\u00a015, 367\u2013384 (1993)","journal-title":"Journal of Algorithms"},{"key":"42_CR8","unstructured":"Dahlhaus, E., Karpinski, M.: The matching problem for strongly chordal graphs is in NC. Technical Report 855-CS, University of Bonn (1986)"},{"key":"42_CR9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0-1 vertices. Journal of Research National Bureau of Standards\u00a069, 125\u2013130 (1965)","journal-title":"Journal of Research National Bureau of Standards"},{"key":"42_CR10","first-page":"166","volume-title":"28th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"D. Grigoriev","year":"1987","unstructured":"Grigoriev, D., Karpinski, M.: The matching problem for bipartite graphs with polynomially bounded permanent is in NC. In: 28th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 166\u2013172. IEEE Computer Society Press, Los Alamitos (1987)"},{"key":"42_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/11786986_40","volume-title":"Automata, Languages and Programming","author":"T.M. Hoang","year":"2006","unstructured":"Hoang, T.M., Mahajan, M., Thierauf, T.: On the Bipartite Unique Perfect Matching Problem. In: Bugliesi, M., et al. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 453\u2013464. Springer, Heidelberg (2006)"},{"key":"42_CR12","first-page":"43","volume-title":"Graph Theory and Theoretical Physics","author":"P.W. Kastelyn","year":"1967","unstructured":"Kastelyn, P.W.: Graph theory and crystal physics. In: Harary, F. (ed.) Graph Theory and Theoretical Physics, pp. 43\u2013110. Academic Press, London (1967)"},{"key":"42_CR13","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198501626.001.0001","volume-title":"Fast Parallel Algorithms for Graph Matching Problems","author":"M. Karpinski","year":"1998","unstructured":"Karpinski, M., Rytter, W.: Fast Parallel Algorithms for Graph Matching Problems. Oxford University Press, Oxford (1998)"},{"key":"42_CR14","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TC.1981.6312171","volume":"30","author":"G. Lev","year":"1981","unstructured":"Lev, G., Pippenger, M., Valiant, L.: A fast parallel algorithm for routing in permutation networks. IEEE Transactions on Computers\u00a030, 93\u2013100 (1981)","journal-title":"IEEE Transactions on Computers"},{"key":"42_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-48686-0_13","volume-title":"Computing and Combinatorics","author":"M. Mahajan","year":"1999","unstructured":"Mahajan, M., Subramanya, P., Vinay, V.: A combinatorial algorithm for pfaffians. In: Asano, T., et al. (eds.) COCOON 1999. LNCS, vol.\u00a01627, pp. 134\u2013143. Springer, Heidelberg (1999)"},{"key":"42_CR16","first-page":"345","volume-title":"19th ACM Symposium on Theory of Computing","author":"K. Mulmuley","year":"1987","unstructured":"Mulmuley, K., Vazirani, U., Vazirani, V.: Matching is as easy as matrix inversion. In: 19th ACM Symposium on Theory of Computing, pp. 345\u2013354. ACM Press, New York (1987)"},{"key":"42_CR17","unstructured":"Toda, S.: Counting problems computationally equivalent to the determinant. Technical Report CSIM 91-07, Dept. of Computer Science and Information Mathematics, University of Electro-Communications, Chofu-shi, Tokyo 182, Japan (1991)"},{"key":"42_CR18","series-title":"London Mathematical Society Lecture Notes Series","volume-title":"Boolean Function Complexity","author":"L. Valiant","year":"1992","unstructured":"Valiant, L.: Why is boolean complexity theory difficult. In: Paterson, M.S. (ed.) Boolean Function Complexity. London Mathematical Society Lecture Notes Series, vol.\u00a0169, Cambridge University Press, Cambridge (1992)"},{"issue":"2","key":"42_CR19","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/0890-5401(89)90017-5","volume":"80","author":"V. Vazirani","year":"1989","unstructured":"Vazirani, V.: NC algorithms for computing the number of perfect matchings in K 3,3-free graphs and related problems. Information and computation\u00a080(2), 152\u2013164 (1989)","journal-title":"Information and computation"},{"key":"42_CR20","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1109\/SCT.1991.160269","volume-title":"6th IEEE Conference on Structure in Complexity Theory","author":"V. Vinay","year":"1991","unstructured":"Vinay, V.: Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits. In: 6th IEEE Conference on Structure in Complexity Theory, pp. 270\u2013284. IEEE Computer Society Press, Los Alamitos (1991)"}],"container-title":["Lecture Notes in Computer Science","STACS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70918-3_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T13:19:34Z","timestamp":1707916774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70918-3_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709176","9783540709183"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70918-3_42","relation":{},"subject":[]}}