{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:34:12Z","timestamp":1742967252313,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319741796"},{"type":"electronic","value":"9783319741802"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-74180-2_9","type":"book-chapter","created":{"date-parts":[[2018,1,15]],"date-time":"2018-01-15T15:12:55Z","timestamp":1516029175000},"page":"105-117","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exact Computation of the Number of Accepting Paths of an NTM"],"prefix":"10.1007","author":[{"given":"Subrahmanyam","family":"Kalyanasundaram","sequence":"first","affiliation":[]},{"given":"Kenneth W.","family":"Regan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,16]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"S Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach, 1st edn. Cambridge University Press, New York (2009)","edition":"1"},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Beigel, R., Gill, J., Hertramp, U.: Counting classes: thresholds, parity, mods, and fewness. In: Choffrut, C., Lengauer, T. (eds.) STACS 1990. LNCS, vol. 415, pp. 49\u201357. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-52282-4_31","DOI":"10.1007\/3-540-52282-4_31"},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Dyer, M., Goldberg, L.A., Greenhill, C., Jerrum, M.: On the relative complexity of approximate counting problems. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 108\u2013119. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44436-X_12","DOI":"10.1007\/3-540-44436-X_12"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Gill III, J.T.: Computational complexity of probabilistic Turing machines. In: Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, STOC 1974, New York, pp. 91\u201395. ACM (1974)","DOI":"10.1145\/800119.803889"},{"issue":"4","key":"9_CR5","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1145\/321356.321362","volume":"13","author":"FC Hennie","year":"1966","unstructured":"Hennie, F.C., Stearns, R.E.: Two-tape simulation of multitape Turing machines. J. ACM 13(4), 533\u2013546 (1966)","journal-title":"J. ACM"},{"key":"9_CR6","series-title":"Lectures in Mathematics. ETH Z\u00fcrich","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-8005-3","volume-title":"Counting, Sampling and Integrating: Algorithms and Complexity","author":"M Jerrum","year":"2003","unstructured":"Jerrum, M.: Counting, Sampling and Integrating: Algorithms and Complexity. Lectures in Mathematics. ETH Z\u00fcrich. Birkh\u00e4user, Basel (2003)"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.tcs.2011.05.018","volume":"417","author":"S Kalyanasundaram","year":"2012","unstructured":"Kalyanasundaram, S., Lipton, R.J., Regan, K.W., Shokrieh, F.: Improved simulation of nondeterministic Turing machines. Theor. Comput. Sci. 417, 66\u201373 (2012). Earlier version in Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, 2010","journal-title":"Theor. Comput. Sci."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Pippenger, N.: Probabilistic simulations (preliminary version). In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, STOC 1982, New York, pp. 17\u201326. ACM (1982)","DOI":"10.1145\/800070.802173"},{"key":"9_CR9","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley Publishing Company, Reading (1994)"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-1-4612-4478-3_9","volume-title":"Complexity Theory Retrospective: In Honor of Juris Hartmanison the Occasion of His Sixtieth Birthday, July 5, 1988","author":"U Sch\u00f6ning","year":"1990","unstructured":"Sch\u00f6ning, U.: The power of counting. In: Selman, A.L. (ed.) Complexity Theory Retrospective: In Honor of Juris Hartmanison the Occasion of His Sixtieth Birthday, July 5, 1988, pp. 204\u2013223. Springer, New York (1990)"},{"key":"9_CR11","unstructured":"Simon, J.: On some central problems in computational complexity. Technical report, Cornell University, Ithaca (1975)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Toda, S.: On the computational power of $${\\sf PP}$$ and $${\\oplus }{\\sf P}$$. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science, FOCS 1989, pp. 514\u2013519. IEEE (1989)","DOI":"10.1109\/SFCS.1989.63527"},{"key":"9_CR13","doi-asserted-by":"publisher","unstructured":"Tor\u00e1n, J.: Counting the number of solutions. In: Rovan, B. (ed.) MFCS 1990. LNCS, vol. 452, pp. 121\u2013134. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0029600","DOI":"10.1007\/BFb0029600"},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1137\/S0097539703438629","volume":"35","author":"D van Melkebeek","year":"2005","unstructured":"van Melkebeek, D., Santhanam, R.: Holographic proofs and derandomization. SIAM J. Comput. 35(1), 59\u201390 (2005). Earlier version in Proceedings of the 18th Annual IEEEConference on Computational Complexity, 2003","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-74180-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:50:56Z","timestamp":1709826656000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-74180-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319741796","9783319741802"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-74180-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guwahati","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 February 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 February 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitg.ac.in\/caldam2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}