- On Uncertainty versus Size in Branching Programs Stasys Jukna
- Combinatorics of Monotone Computations Stasys Jukna \Lambday
- Proceedings of 12th Annual IEEE Conference on Computational Complexity (June 24--27, 1997, Ulm, Germany), pp. 302--313. Finite Limits and Monotone Computations
- Neither Reading Few Bits Twice nor Reading Illegally Helps Much Dept. of Computer Science, University of Trier, D54286 Trier, Germany
- Yet Harder Knapsack Problems$ Stasys Jukna,1
- Reprinted (without any changes) from: Mathematical Logics and Its Applications, vol. 5 (1987), pp.2231
- On Graph Complexity Universitat Frankfurt, Institut fur Informatik
- Proc. of 31th Conf. of Lithuanian Math. Society, (Kaunas, June 2829, 1990) Monotone Circuits and Local Computations
- On MultiPartition Communication Complexity
- TheoreticalComputerScience 57 (1988) 113429 North-Holland
- ON P VERSUS NP``CONP FOR DECISION TREES AND READONCE BRANCHING
- TriangleFreeness is Hard to Detect \Lambda Stasys Jukna 1;2;3 Georg Schnitger 1;3
- Computing threshold functions by depth3 threshold circuits with smaller thresholds of their gates 1
- Finite Limits and Lower Bounds for Circuits Size \Lambda Stasys Jukna yz
- ENTROPY OF OPERATORS OR WHY MATRIX MULTIPLICATION IS HARD FOR DEPTH-TWO CIRCUITS
- 10.6 Monotone circuits 121 (3) the whole string F 2 (#) has at most s positions that are non#'s.
- UNIVERSITAT TRIER Mathematik / Informatik
- UNIVERSITAT TRIER Mathematik / Informatik
- Technical Report Nr. 448, University of Dortmund, 1992 Journal version in: RAIRO Theoretical Informatics and Applications, vol. 29, Nr. 1 (1995), 7583
- Submitted to: Inf. Processing Letters (November 11, 1998) Linear codes are hard for oblivious readonce
- Very large cliques are easy to detect A. E. Andreev # S. Jukna +#
- Some Notes on the Information Flow in ReadOnce Branching Stasys Jukna \Lambda Stanislav Z'ak y
- A Criterion for Monotone Circuit Complexity Stasys Jukna
- On Uncertainty versus Size in Branching Programs Stasys Jukna # Stanislav
- On nondeterministic linear time branching programs January 7, 2002
- Cutting Planes Cannot Approximate Some Integer Programs$ Stasys Jukna,1
- On the Minimum Number of Negations Leading to Super-polynomial Savings
- On covering graphs by complete bipartite subgraphs S. Juknaa,1, A. S. Kulikovb,2
- DISPROVING THE SINGLE LEVEL CONJECTURE STASYS JUKNA
- Neither Reading Few Bits Twice nor Reading Illegally Helps Much Dept. of Computer Science, University of Trier, D-54286 Trier, Germany
- TOPDOWN LOWER BOUNDS FOR DEPTHTHREE CIRCUITS
- On the P versus NP intersected with co-NP question in communication complexity
- SOME BOUNDS ON MULTIPARTY COMMUNICATION COMPLEXITY OF
- Min-Rank Conjecture for Log-Depth Circuits $ Stasys Juknaa,,1
- .'--:.!;..r';..,'.!','.:'..".",;di;i{".:];.,l.'!.3"r..:"-'.i
- On Multi-Partition Communication Complexity
- Circuits with Arbitrary Gates for Random S. Jukna G. Schnitger
- Representing (0,1)-Matrices by Boolean Circuits$ Stasys Juknaa,1
- Entropy of Operators Nechiporuk for Depth-2 Circuits
- A nondeterministic space-time tradeoff for linear codes To appear in IPL
- On Set Intersection Representations of Graphs The intersection dimension of a bipartite graph with respect to a type L is the smallest
- Very large cliques are easy to detect A. E. Andreev
- Expanders and time-restricted branching programs Stasys Jukna1
- Single Level Conjecture for Quadratic Functions and Stasys Jukna
- On the P versus NP intersected with co-NP question in communication complexity
- COMBINATORICA Bolyai Society Springer-Verlag
- 519.714,4 + 510.52 . exp ((log2/)2
- Graphs and Circuits: Some Further Remarks Institute of Mathematics
- j t r E E E F t 3 1 F E E 3 F F . ,
- Reprinted (without any changes) from: Mathematical Logics and Its Applications, vol. 5 (1987), pp.22-31
- UNIVERSITAT TRIER Mathematik / Informatik
- Manuscript version: October 1, 1996 DIMACS workshop on Feasible Arithmetics and Proof Complexity (Submitted)
- TWO LOWER BOUNDS FOR CIRCUITS OVER THE BASIS ( &. V. -) CP2"e ~~ Lnaz'~ Repot t.)
- INFOPJ~TION FLOW AND WIDTH OF BRANCHING PROGIKA~S (Extended Abstract )
- Computational Complexity of Graphs Stasys Jukna
- Limitations of Incremental Dynamic Programming Stasys Jukna
- THE EFFECTOF NULL-CHAINSONTHE COMPLEXITYOF CONTACT SCHEMES Stasys P. Jukna
