The following pages link to Leon Livovschi (Q589305):
Displaying 32 items.
- (Q796992) (redirect page) (← links)
- Lower bound for the number of states of purposeful deterministic automata (Q796993) (← links)
- Bounded-depth, polynomial-size circuits for symmetric functions (Q1063574) (← links)
- Hierarchical verification of asynchronous circuits using temporal logic (Q1070998) (← links)
- Single test for closed contacts in block circuits (Q1094392) (← links)
- The monotone circuit complexity of Boolean functions (Q1094870) (← links)
- Path testing in circuits with functional units (Q1095869) (← links)
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition (Q1095871) (← links)
- Modal functions for concise definition of state machines and products (Q1183435) (← links)
- Finite automata on directed graphs (Q1191024) (← links)
- Asymptotics of the Shannon function for switching circuits in the ``Sheffer stroke'' basis with partial unreliability (Q1310741) (← links)
- On the complexity of realizing the powers of a Boolean \((n,n)\)-function (Q1345680) (← links)
- Nonlinearity, local and global avalanche characteristics of balanced Boolean functions (Q1598824) (← links)
- The reliability of networks in the basis \((x \&{} y, x{\vee{}}y, {\bar x})\) in the case of constant faults of the same type at the outputs of the gates (Q1803080) (← links)
- An information theoretic model of a reliable computer network (Q1808993) (← links)
- Network models with fixed parameters at the communication nodes. I (Q1903447) (← links)
- The stochastic problem of synthesizing the shortest connecting network (Q1903461) (← links)
- (Q3964495) (← links)
- (Q4090368) (← links)
- (Q4174239) (← links)
- (Q4712379) (← links)
- (Q5527823) (← links)
- (Q5547592) (← links)
- (Q5565130) (← links)
- (Q5588133) (← links)
- (Q5603204) (← links)
- (Q5642504) (← links)
- (Q5661436) (← links)
- (Q5670551) (← links)
- (Q5670552) (← links)
- (Q5729529) (← links)
- Problems of order optimization (Q5960195) (← links)