{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T22:26:32Z","timestamp":1649024792221},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,2,11]],"date-time":"2009-02-11T00:00:00Z","timestamp":1234310400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1007\/s00236-009-0089-4","type":"journal-article","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T06:31:59Z","timestamp":1234247519000},"page":"155-168","source":"Crossref","is-referenced-by-count":0,"title":["Random walks for selected boolean implication and equivalence problems"],"prefix":"10.1007","volume":"46","author":[{"given":"K.","family":"Subramani","sequence":"first","affiliation":[]},{"given":"Hong-Jian","family":"Lai","sequence":"additional","affiliation":[]},{"given":"Xiaofeng","family":"Gu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,2,11]]},"reference":[{"issue":"2","key":"89_CR1","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1145\/201019.201022","volume":"42","author":"D.R. Karger","year":"1995","unstructured":"Karger D.R., Klein P.N., Tarjan R.E.: A randomized linear-time algorithm to find minimum spanning trees. J. ACM 42(2), 321\u2013328 (1995)","journal-title":"J. ACM"},{"key":"89_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani R., Raghavan P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"89_CR3","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: On selecting a satisfying truth assignment. In: IEEE, editor, Proceedings: 32nd annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, October 1\u20134, 1991, pp. 163\u2013169, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA, 1991. IEEE Computer Society Press","DOI":"10.1109\/SFCS.1991.185365"},{"key":"89_CR4","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou C.H.: Computational Complexity. Addison-Wesley, New York (1994)"},{"key":"89_CR5","volume-title":"Probability Models","author":"S.M. Ross","year":"2000","unstructured":"Ross S.M.: Probability Models, 7th edn. Academic Press, Inc., London (2000)","edition":"7"},{"key":"89_CR6","doi-asserted-by":"crossref","unstructured":"Sch\u00f6ning, U.: New algorithms for k-SAT based on the local search principle. In: MFCS: Symposium on Mathematical Foundations of Computer Science (2001)","DOI":"10.1007\/3-540-44683-4_9"},{"key":"89_CR7","unstructured":"Subramani, K., Gu, X.: Absorbing random walks and the nae2sat problem. Fundamenta Informatica. (2008, Submitted)"},{"issue":"3","key":"89_CR8","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1142\/S0129054105003182","volume":"16","author":"K. Subramani","year":"2005","unstructured":"Subramani K.: Cascading random walks. Int. J. Found. Comput. Sci. (IJFCS) 16(3), 599\u2013622 (2005)","journal-title":"Int. J. Found. Comput. Sci. (IJFCS)"},{"key":"89_CR9","first-page":"89","volume-title":"Proceedings of the 2nd Annual International Frontiers of Algorithmics Workshop. Lecture Notes in Computer Science, vol. 5059","author":"K. Subramani","year":"2008","unstructured":"Subramani K. et\u00a0al.: Absorbing random walks and the nae2sat problem. In: Preparata, F. et\u00a0al. (eds) Proceedings of the 2nd Annual International Frontiers of Algorithmics Workshop. Lecture Notes in Computer Science, vol. 5059, pp. 89\u2013100. Springer, Heidelberg (2008)"},{"issue":"11","key":"89_CR10","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L.G. Valiant","year":"1984","unstructured":"Valiant L.G.: A theory of the learnable. Commun. ACM 27(11), 1134\u20131142 (1984)","journal-title":"Commun. ACM"},{"key":"89_CR11","doi-asserted-by":"crossref","unstructured":"Wei, W., Selman, B.: Accelerating random walks. In: The Eighth International Conference on Constraint Programming (CP), LNCS, pp. 216\u2013232 (2002)","DOI":"10.1007\/3-540-46135-3_15"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-009-0089-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-009-0089-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-009-0089-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T13:41:55Z","timestamp":1558705315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-009-0089-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,11]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,4]]}},"alternative-id":["89"],"URL":"https:\/\/doi.org\/10.1007\/s00236-009-0089-4","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2,11]]}}}