The complexity of the connected graph access structure on seven participants (Q515397): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94A62 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6695436 / rank
 
Normal rank
Property / zbMATH Keywords
 
access structure
Property / zbMATH Keywords: access structure / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity
Property / zbMATH Keywords: complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
secret-sharing scheme
Property / zbMATH Keywords: secret-sharing scheme / rank
 
Normal rank
Property / zbMATH Keywords
 
connected graph
Property / zbMATH Keywords: connected graph / rank
 
Normal rank
Property / zbMATH Keywords
 
induced subgraph
Property / zbMATH Keywords: induced subgraph / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1515/jmc-2016-0017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2590030703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph decompositions and secret sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the classification of ideal secret sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some improved bounds on the information rate of perfect secret sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An impossibility result on graph secret sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the graph access structures on six participants / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to share a secret / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition constructions for secret-sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted decomposition construction for perfect secret sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect secret sharing schemes on five participants / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 13:04, 13 July 2024

scientific article
Language Label Description Also known as
English
The complexity of the connected graph access structure on seven participants
scientific article

    Statements

    Identifiers