The following pages link to Stasys P. Jukna (Q1109753):
Displayed 49 items.
- Tropical Kirchhoff's formula and postoptimality in matroid optimization (Q2217458) (← links)
- On lower bounds for read-\(k\)-times branching programs (Q2366719) (← links)
- Expanders and time-restricted branching programs (Q2378527) (← links)
- Incremental versus non-incremental dynamic programming (Q2417149) (← links)
- On uniformity within \(NC^ 1\) (Q2640342) (← links)
- Sufficient-completeness, ground-reducibility and their complexity (Q2641108) (← links)
- Lower bounds for Boolean circuits of bounded negation width (Q2672949) (← links)
- (Q2762506) (← links)
- Tropical Complexity, Sidon Sets, and Dynamic Programming (Q2832574) (← links)
- (Q3033329) (← links)
- (Q3036681) (← links)
- (Q3048204) (← links)
- Extremal Combinatorics (Q3061152) (← links)
- (Q3352967) (← links)
- On Graph Complexity (Q3419765) (← links)
- Computational Complexity of Graphs (Q3463386) (← links)
- (Q3496294) (← links)
- On set intersection representations of graphs (Q3633007) (← links)
- (Q3662621) (← links)
- (Q3663285) (← links)
- (Q3682473) (← links)
- (Q3735698) (← links)
- (Q3735699) (← links)
- (Q3751515) (← links)
- (Q3754637) (← links)
- (Q3783567) (← links)
- (Q3795613) (← links)
- (Q3801064) (← links)
- (Q3801065) (← links)
- (Q3888519) (← links)
- (Q4255576) (← links)
- (Q4266528) (← links)
- A note on read-$k$ times branching programs (Q4362278) (← links)
- (Q4375792) (← links)
- (Q4471998) (← links)
- Minkowski Complexity of Sets: An Easy Lower Bound (Q4575425) (← links)
- Some bounds on multiparty communication complexity of pointer jumping (Q4593967) (← links)
- (Q4699308) (← links)
- (Q4744315) (← links)
- (Q4792910) (← links)
- Notes on Hazard-Free Circuits (Q4986809) (← links)
- Coin Flipping in Dynamic Programming Is Almost Useless (Q5053068) (← links)
- Lower Bounds for DeMorgan Circuits of Bounded Negation Width (Q5090491) (← links)
- Approximation Limitations of Pure Dynamic Programming (Q5216795) (← links)
- (Q5427806) (← links)
- Disproving the Single Level Conjecture (Q5470747) (← links)
- Coin Flipping Cannot Shorten Arithmetic Computations (Q5742361) (← links)
- Combinatorics of monotone computations (Q5928586) (← links)
- Tropical Circuit Complexity (Q6145082) (← links)