249 results on '"Stasys Jukna"'
Search Results
2. Tropical Kirchhoff's formula and postoptimality in matroid optimization.
3. Notes on Hazard-Free Circuits.
4. Notes on Boolean Read-k and Multilinear Circuits.
5. Notes on Monotone Read-k Circuits.
6. Lower Bounds for DeMorgan Circuits of Bounded Negation Width.
7. Coin Flipping in Dynamic Programming Is Almost Useless.
8. Approximation Limitations of Pure Dynamic Programming.
9. Greedy can beat pure dynamic programming.
10. Incremental versus non-incremental dynamic programming.
11. Coin Flipping Cannot Shorten Arithmetic Computations.
12. Tropical Kirchhoff's Formula and Postoptimality in Matroid Optimization.
13. Sorting Can Exponentially Speed Up Pure Dynamic Programming.
14. Notes on Hazard-Free Circuits.
15. Reciprocal Inputs in Arithmetic and Tropical Circuits.
16. Minkowski Complexity of Sets: An Easy Lower Bound.
17. Sorting Can Exponentially Speed Up Pure Dynamic Programming.
18. Lower bounds for monotone counting circuits.
19. On the optimality of Bellman-Ford-Moore shortest path algorithm.
20. Tropical Complexity, Sidon Sets, and Dynamic Programming.
21. Reciprocal inputs in arithmetic and tropical circuits
22. Extremal Combinatorics - With Applications in Computer Science
23. Greedy can also beat pure dynamic programming.
24. Lower Bounds for Circuits of Bounded Negation Width.
25. Approximation Limitations of Tropical Circuits.
26. Derandomizing Dynamic Programming and Beyond.
27. Lower Bounds for Tropical Circuits and Dynamic Programs.
28. Limitations of Incremental Dynamic Programming.
29. Complexity of Linear Boolean Operators.
30. On Multipartition Communication Complexity.
31. Cutting planes cannot approximate some integer programs.
32. Clique problem, cutting plane proofs and communication complexity.
33. Some Notes on the Information Flow in Read-Once Branching Programs.
34. Min-rank conjecture for log-depth circuits.
35. Yet harder knapsack problems.
36. Representing (0, 1)-matrices by boolean circuits.
37. On convex complexity measures.
38. Entropy of Operators or why Matrix Multiplication is Hard for Depth-Two Circuits.
39. On set intersection representations of graphs.
40. On covering graphs by complete bipartite subgraphs.
41. A nondeterministic space-time tradeoff for linear codes.
42. On Branching Programs With Bounded Uncertainty (Extended Abstract).
43. Very large cliques are easy to detect.
44. Expanders and time-restricted branching programs.
45. Finite Limits and Monotone Computations: The Lower Bounds Criterion.
46. On O versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs.
47. Some Bounds on Multiparty Communication Complexity of Pointer Jumping.
48. Exponential lower bounds for semantic resolution.
49. On Graph Complexity.
50. Disproving the Single Level Conjecture.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.