{ "labelLang" : "hun", "responseDate" : "2024-03-28 12:07", "content" : { "otype" : "JournalArticle", "mtid" : 31476822, "status" : "VALIDATED", "published" : true, "comment" : "Export Date: 20 February 2024 \n Correspondence Address: Davarzani, M.; Faculty of Mathematics and Computer Science, Iran; email: mahmood.davarzani@gmail.com", "unhandledTickets" : 0, "deleted" : false, "lastRefresh" : "2024-02-20T10:45:10.605+0000", "lastModified" : "2020-08-28T20:19:34.329+0000", "created" : "2020-08-28T20:19:33.633+0000", "creator" : { "otype" : "Admin", "mtid" : 565, "link" : "/api/admin/565", "label" : "WoS import (admin)", "familyName" : "WoS", "givenName" : "import", "published" : true, "snippet" : true }, "lastDuplumSearch" : "2024-02-20T10:19:36.279+0000", "validated" : "2020-08-28T20:19:33.710+0000", "validator" : { "otype" : "Admin", "mtid" : 565, "link" : "/api/admin/565", "label" : "WoS import (admin)", "familyName" : "WoS", "givenName" : "import", "published" : true, "snippet" : true }, "core" : false, "citation" : true, "publicationPending" : false, "type" : { "otype" : "PublicationType", "mtid" : 24, "link" : "/api/publicationtype/24", "label" : "Folyóiratcikk", "code" : 24, "otypeName" : "JournalArticle", "listPosition" : 1, "published" : true, "oldId" : 24, "snippet" : true }, "subType" : { "otype" : "SubType", "mtid" : 10000059, "link" : "/api/subtype/10000059", "label" : "Szakcikk (Folyóiratcikk)", "name" : "Szakcikk", "nameEng" : "Article", "docType" : { "otype" : "PublicationType", "mtid" : 24, "link" : "/api/publicationtype/24", "label" : "Folyóiratcikk", "code" : 24, "otypeName" : "JournalArticle", "listPosition" : 1, "published" : true, "oldId" : 24, "snippet" : true }, "listPosition" : 101, "published" : true, "oldId" : 10000059, "snippet" : true }, "category" : { "otype" : "Category", "mtid" : 1, "link" : "/api/category/1", "label" : "Tudományos", "published" : true, "oldId" : 1, "snippet" : true }, "languages" : [ { "otype" : "Language", "mtid" : 10002, "link" : "/api/language/10002", "label" : "Angol", "name" : "Angol", "nameEng" : "English", "published" : true, "oldId" : 2, "snippet" : true } ], "firstAuthor" : "Davarzani, M.", "authorships" : [ { "otype" : "PersonAuthorship", "mtid" : 92784707, "link" : "/api/authorship/92784707", "label" : "Davarzani, M. ✉", "listPosition" : 1, "share" : 0.0, "first" : true, "last" : false, "corresponding" : true, "familyName" : "Davarzani", "givenName" : "M.", "authorTyped" : true, "editorTyped" : false, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 1, "link" : "/api/authorshiptype/1", "label" : "Szerző", "code" : 0, "published" : true, "oldId" : 0, "snippet" : true }, "published" : false, "snippet" : true } ], "title" : "The complexity of the graph access structures on seven participants", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 17356282, "link" : "/api/publicationidentifier/17356282", "label" : "WoS: 000559341700007", "source" : { "otype" : "PlainSource", "mtid" : 1, "link" : "/api/publicationsource/1", "label" : "WoS", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "WoS", "nameEng" : "WoS", "linkPattern" : "https://www.webofscience.com/wos/woscc/full-record/@@@", "publiclyVisible" : true, "published" : true, "oldId" : 1, "snippet" : true }, "idValue" : "000559341700007", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/000559341700007", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 25631640, "link" : "/api/publicationidentifier/25631640", "label" : "Scopus: 85090147677", "source" : { "otype" : "PlainSource", "mtid" : 3, "link" : "/api/publicationsource/3", "label" : "Scopus", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "Scopus", "linkPattern" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-@@@", "publiclyVisible" : true, "published" : true, "oldId" : 3, "snippet" : true }, "validState" : "IDENTICAL", "idValue" : "85090147677", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85090147677", "published" : false, "snippet" : true } ], "journal" : { "otype" : "Journal", "mtid" : 39748, "link" : "/api/journal/39748", "label" : "ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS 1126-8042 2239-0227", "pIssn" : "1126-8042", "eIssn" : "2239-0227", "reviewType" : "REVIEWED", "noIF" : false, "sciIndexed" : true, "scopusIndexed" : true, "lang" : "FOREIGN", "hungarian" : false, "published" : true, "oldId" : 39748, "snippet" : true }, "issue" : "44", "firstPage" : "78", "lastPage" : "86", "firstPageOrInternalIdForSort" : "78", "pageLength" : 9, "publishedYear" : 2020, "abstractText" : "In this paper, we deal with determining the values for the complexity of the graph access structures on seven participants. As [10], it was determined exact values of the 91 of the complexities of access structures. In this paper we give simple proof by entropy and shannon inequalities for determining the lower bound of complexity which used for determining of lower bound of the 51 graph access structure. Further, we establish the exact values of the complexity of five graphs, which remained as open problems in [10]. Also we obtain the tight bounds for complexity of five access structures. Keywords:", "subjects" : [ { "otype" : "Classification", "mtid" : 10003, "link" : "/api/classification/10003", "label" : "Matematika", "published" : true, "snippet" : true } ], "keywords" : [ { "otype" : "Keyword", "mtid" : 1184767, "link" : "/api/keyword/1184767", "label" : "Entropy method", "published" : true, "oldId" : 1184767, "snippet" : true }, { "otype" : "Keyword", "mtid" : 1721952, "link" : "/api/keyword/1721952", "label" : "complexity", "published" : true, "snippet" : true }, { "otype" : "Keyword", "mtid" : 2089961, "link" : "/api/keyword/2089961", "label" : "Perfect secret sharing scheme", "published" : true, "snippet" : true }, { "otype" : "Keyword", "mtid" : 2089962, "link" : "/api/keyword/2089962", "label" : "Graph access structures", "published" : true, "snippet" : true } ], "digital" : null, "printed" : null, "sourceYear" : 2020, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : false, "nationalOrigin" : null, "missingAuthor" : false, "oaType" : "NONE", "oaCheckDate" : "2024-02-20", "oaFree" : false, "citationCount" : 0, "citationCountUnpublished" : 0, "citationCountWoOther" : 0, "independentCitCountWoOther" : 0, "doiCitationCount" : 0, "wosCitationCount" : 0, "scopusCitationCount" : 0, "independentCitationCount" : 0, "unhandledCitationCount" : 0, "citingPubCount" : 0, "independentCitingPubCount" : 0, "unhandledCitingPubCount" : 0, "citedPubCount" : 1, "citedCount" : 1, "ratings" : [ { "otype" : "SjrRating", "mtid" : 10842823, "link" : "/api/sjrrating/10842823", "label" : "sjr:Q4 (2020) Scopus - Mathematics (miscellaneous) ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS 1126-8042 2239-0227", "listPos" : 331, "rankValue" : 1.0, "type" : "journal", "ratingType" : { "otype" : "RatingType", "mtid" : 10002, "link" : "/api/ratingtype/10002", "label" : "sjr", "code" : "sjr", "published" : true, "snippet" : true }, "subject" : { "otype" : "ClassificationExternal", "mtid" : 2601, "link" : "/api/classificationexternal/2601", "label" : "Scopus - Mathematics (miscellaneous)", "published" : true, "oldId" : 2601, "snippet" : true }, "ranking" : "Q4", "calculation" : "DIRECT", "published" : true, "snippet" : true } ], "ratingsForSort" : "Q4", "hasCitationDuplums" : false, "directInstitutesForSort" : "", "ownerAuthorCount" : 1, "ownerInstituteCount" : 10, "directInstituteCount" : 0, "authorCount" : 1, "contributorCount" : 0, "hasQualityFactor" : false, "link" : "/api/publication/31476822", "label" : "Davarzani M.. The complexity of the graph access structures on seven participants. (2020) ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS 1126-8042 2239-0227 44 78-86", "template" : "