Searching for authors named "Stasys Jukna" – sorted by Relevance.
-
Finite Limits and Lower Bounds for Circuits Size
- Finite Limits and Lower Bounds for Circuits Size Stasys Jukna yz Abstract The lower bounds
- Cited by 2 (2 self) – Add To MetaCart
-
Exponential Lower Bounds on the Size of Clause Based Semantic Derivations
- (Submitted) Exponential Lower Bounds on the Size of Clause Based Semantic Derivations Stasys Jukna
- Cited by 1 (0 self) – Add To MetaCart
-
Expanders and time-restricted branching programs
- Expanders and time-restricted branching programs Abstract Stasys Jukna Institute of Mathematics
- Cited by 1 (1 self) – Add To MetaCart
-
Combinatorics of Monotone Computations
- Combinatorics of Monotone Computations Stasys Jukna y December 9, 1998 Abstract Our main result
- Cited by 5 (0 self) – Add To MetaCart
-
A Note on Read-k Times Branching Programs
- 94--027 A Note on Read-k Times Branching Programs y Stasys Jukna z Received December 23, 1994
- Cited by 6 (1 self) – Add To MetaCart
-
Finite Limits and Monotone Computations: The Lower Bounds Criterion
- , Germany), pp. 302--313. Finite Limits and Monotone Computations: The Lower Bounds Criterion Stasys Jukna
- Cited by 4 (1 self) – Add To MetaCart
-
Computing Threshold Functions by Depth-3 Threshold Circuits with Smaller Thresholds of Their Gates
- 1 Stasys Jukna 2 Dept. of Computer Science, University of Trier, D-54286 Trier, Germany e
- Cited by 4 (0 self) – Add To MetaCart
-
Monotone Circuits and Local Computations
- and Local Computations Stasys Jukna Let CLIQUE n;k denote the monotone Boolean function of n = \Gamma m
- Cited by 1 (1 self) – Add To MetaCart
-
A Criterion for Monotone Circuit Complexity
- A Criterion for Monotone Circuit Complexity Stasys Jukna Institute of Mathematics Akademijos 4
- Cited by 3 (2 self) – Add To MetaCart
-
bounds on communication complexity
- .22-31 ISSN 0207-8961 Lower Bounds on Communication Complexity ∗ Stasys P. Jukna Abstract A notion
- Cited by 3 (1 self) – Add To MetaCart

