The following pages link to Stasys P. Jukna (Q1109753):
Displayed 50 items.
- (Q168627) (redirect page) (← links)
- On the optimality of Bellman-Ford-Moore shortest path algorithm (Q266282) (← links)
- Lower bounds for monotone counting circuits (Q313809) (← links)
- Cutting planes cannot approximate some integer programs (Q453048) (← links)
- Clique problem, cutting plane proofs and communication complexity (Q456115) (← links)
- Lower bounds for tropical circuits and dynamic programs (Q493653) (← links)
- Limitations of incremental dynamic programming (Q517805) (← links)
- Boolean function complexity. Advances and frontiers. (Q642463) (← links)
- Yet harder knapsack problems (Q653327) (← links)
- Min-rank conjecture for log-depth circuits (Q657911) (← links)
- Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates (Q672256) (← links)
- (Q752706) (redirect page) (← links)
- Stability and computability in coherent domains (Q752707) (← links)
- On the power of probabilistic strategies in inductive inference (Q760795) (← links)
- Sorting can exponentially speed up pure dynamic programming (Q783692) (← links)
- One-sided error probabilistic inductive inference and reliable frequency identification (Q803119) (← links)
- Size-depth trade-offs for monotone arithmetic circuits (Q804295) (← links)
- (Q932699) (redirect page) (← links)
- Very large cliques are easy to detect (Q932700) (← links)
- On convex complexity measures (Q964405) (← links)
- Entropy of operators or why matrix multiplication is hard for depth-two circuits (Q970107) (← links)
- A nondeterministic space-time tradeoff for linear codes (Q976097) (← links)
- On covering graphs by complete bipartite subgraphs (Q1025967) (← links)
- On the minimum number of negations leading to super-polynomial savings (Q1029051) (← links)
- On the P versus NP intersected with co-NP question in communication complexity (Q1044738) (← links)
- Representing \((0,1)\)-matrices by Boolean circuits (Q1045160) (← links)
- Almost all one-rule Thue systems have decidable word problems (Q1057265) (← links)
- The computational complexity of maximization and integration (Q1057267) (← links)
- Complexity results on the conjugacy problem for monoids (Q1073015) (← links)
- A finite Thue system with decidable word problem and without equivalent finite canonical system (Q1073016) (← links)
- The complexity of central slice functions (Q1084375) (← links)
- Thue systems as rewriting systems (Q1099642) (← links)
- Entropy of contact circuits and lower bounds on their complexity (Q1109754) (← links)
- Probabilistic quantifiers and games (Q1112019) (← links)
- Optimal parallel selection has complexity O(log log N) (Q1118404) (← links)
- Neither reading few bits twice nor reading illegally helps much (Q1130185) (← links)
- Nonlinear lower bounds on the number of processors of circuits with sublinear separators (Q1183605) (← links)
- On the shape of mathematical arguments (Q1188723) (← links)
- On the theory of average case complexity (Q1190984) (← links)
- The complexity of circuit value and network stability (Q1190989) (← links)
- Results on communication complexity classes (Q1190990) (← links)
- Time-space tradeoffs for set operations (Q1210542) (← links)
- Some bounds on multiparty communication complexity of pointer jumping (Q1272658) (← links)
- On uncertainty versus size in branching programs. (Q1401198) (← links)
- On P versus NP\(\cap\)co-NP for decision trees and read-once branching programs (Q1587348) (← links)
- Linear codes are hard for oblivious read-once parity branching programs (Q1606909) (← links)
- Greedy can beat pure dynamic programming (Q1628699) (← links)
- Quasirelations in a free group and transformator equivalence problems (Q1820772) (← links)
- On multi-partition communication complexity (Q1886038) (← links)
- Top-down lower bounds for depth-three circuits (Q1904663) (← links)