{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T05:10:50Z","timestamp":1733202650623,"version":"3.30.0"},"reference-count":0,"publisher":"SAGE Publications","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.3233\/fi-1996-25205","type":"journal-article","created":{"date-parts":[[2019,12,3]],"date-time":"2019-12-03T01:45:47Z","timestamp":1575337547000},"page":"201-214","source":"Crossref","is-referenced-by-count":20,"title":["COMPARITIVE ANALYSIS OF DETERMINISTIC AND NONDETERMINISTIC DECISION TREE COMPLEXITY. GLOBAL APPROACH"],"prefix":"10.1177","volume":"25","author":[{"given":"Mikhail","family":"Moshkov","sequence":"first","affiliation":[{"name":"Research Institute for Applied Mathematics and Cybernetics of Nizhni Novgorod State University 10, Uljanova St., Nizhni Novgorod, 603005, Russia"}]}],"member":"179","container-title":["Fundamenta Informaticae"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/FI-1996-25205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T11:50:16Z","timestamp":1733140216000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/FI-1996-25205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996]]}},"URL":"https:\/\/doi.org\/10.3233\/fi-1996-25205","relation":{},"ISSN":["0169-2968"],"issn-type":[{"type":"print","value":"0169-2968"}],"subject":[],"published":{"date-parts":[[1996]]}}}