Titlebook: Algebraic Informatics; 4th International Co Franz Winkler Conference proceedings 2011 Springer Berlin Heidelberg 2011 Groebner bases.algebr

MILK

,-Rank-Width of (Edge-Colored) Graphs extend most of the results known for the rank-width of undirected graphs to the .-rank-width of graphs: cubic-time recognition algorithm, characterisation by excluded configurations under . and ., and algebraic characterisation by graph operations. We also show that the rank-width of undirected graphs is a special case of .-rank-width.

BILE

Perceive

Hadamard Matrices, Designs and Their Secret-Sharing Schemesces thus providing the necessary structures to describe a two-part secret-sharing scheme based on Hadamard designs. Furthermore, we exhibit how some algebraic aspects of secret-sharing cryptography are interpreted in terms of combinatorial design theory, such as the access structure and the security of the secret-sharing schemes.

凹槽

無法破譯

0302-9743 graphs arrays, etc. decision problems, algebraic characterization of logical theories, process algebra, algebraic algorithms, algebraic coding theory, and algebraic aspects of cryptography.978-3-642-21492-9978-3-642-21493-6Series ISSN 0302-9743 Series E-ISSN 1611-3349

易于交談

hypnogram

Nathan Wasser,Reiner H?hnle,Richard Bubel partially incomplete block designs (PBIBDs). Such designs can be used in the construction of some classes of codes for which we are able to calculate the parameters and to prove that in some cases they are also cyclic.

Dignant

Lecture Notes in Computer Scienceal subclasses of variable tree automata. The universality problem is also decidable in a subclass of variable tree automata. We demonstrate the robustness of our model by connecting it to variable finite automata and indicating several characterizations of recognizable tree languages over infinite ranked alphabets.

cardiopulmonary

有角