Optimal \((2, n )\) visual cryptographic schemes (Q851754): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10623-006-0011-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015427393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the contrast in visual cryptography schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visual cryptography for grey level images / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on Visual Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365722 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:36, 25 June 2024

scientific article
Language Label Description Also known as
English
Optimal \((2, n )\) visual cryptographic schemes
scientific article

    Statements

    Optimal \((2, n )\) visual cryptographic schemes (English)
    0 references
    0 references
    0 references
    22 November 2006
    0 references
    0 references
    Pixel expansion
    0 references
    Regular graph design
    0 references
    Relative contrast
    0 references
    Share
    0 references
    0 references