Geodesic

Kazanskii Gosudarstvennyi Universitet. Uchenye Zapiski. Seriya Fiziko-Matematichaskie Nauki

Sommaire

The XV International Conference “Problems of Theoretical Cybernetics”
p. 5-6
On Complexity of Classical Simulation of Quantum Branching Programs
p. 7-15
On Some Closed Classes of Self-dual Partial Many-valued Functions
p. 16-24
On Reliability of Combinatorial Circuits in Bases Containing Functions with at Most Three Variables
p. 25-35
Learning Read-Once Functions Individually
p. 36-44
Quantum and Classical Simulation of Quantum Branching Programs
p. 45-58
On the Number of Independent Sets in Perfect $q$-ary Trees
p. 59-64
Classes of Functions of the $k$-valued Logic Monotone with Respect to Partially Ordered Sets
p. 65-71
Embeddings from the Class of Parametric Mappings of Bounded Distortion
p. 72-79
On a Matrix of First Moments for Decomposable Stochastic CF-Grammar
p. 80-89
On Full Checking Tests under Local Glueings of Variables in Boolean Functions
p. 90-97
On Multiplexer Function Complexity in the $\pi$-schemes Class
p. 98-106
On the Complexity of Randomized Read-once Branching Programs
p. 107-113
Special Expansions of Underdetermined Partial Boolean Functions
p. 114-119
Clones, Co-Clones, Hyperclones and Superclones
p. 120-125
Security of Steganographic Systems
p. 126-132
On the Synthesis of Schemes Permitting Short Tests and on the Estimates of the Test Lengths
p. 133-138
On the Number of Sum-free Sets
p. 139-146
Fast Algorithm for Building Polarized Polynomial Coefficients' Vectors of $k$-valued Functions
p. 147-153
About Circuit Reliability in Full Bases, Containing a Vote Function with Input Inverse Failures
p. 154-163
On Complexity of Oriented Contact Circuits with Limited Out-degree
p. 164-172
High Accuracy Asymptotic Bounds for Predicate Circuits over a Class of Specific Predicate Bases
p. 173-184