222 results on '"Ker-I Ko"'
Search Results
2. Centralized and decentralized rumor blocking problems.
3. Competitive profit maximization in social networks.
4. An approximation algorithm for maximum weight budgeted connected set cover.
5. On the Complexity of Finding Circumscribed Rectangles for a Two-Dimensional Domain.
6. On the Complexity of Computing the Logarithm and Square Root Functions on a Complex Domain.
7. On the complexity of computing the Hausdorff distance.
8. On parallel complexity of analytic functions.
9. On logarithmic-space computable real numbers.
10. On the Parameterized Complexity of Pooling Design.
11. On the complexity of non-unique probe selection.
12. On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane.
13. On the complexity of computing the logarithm and square root functions on a complex domain.
14. Jordan curves with polynomial inverse moduli of continuity.
15. On the Measure of Two-Dimensional Regions with Polynomial-Time computables Boundaries.
16. Jordan Curves with Polynomial Inverse Moduli of Continuity.
17. On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain.
18. The computational complexity of distance functions of two-dimensional domains.
19. On the Complexity of Finding Paths in a Two-Dimensional Domain II: Piecewise Straight-Line Paths.
20. On the complexity of finding paths in a two-dimensional domain I: Shortest paths.
21. A greedy approximation for minimum connected dominating sets.
22. Some complexity issues on the simply connected regions of the two-dimensional plane.
23. Approximation Algorithm for Minimum Weight Connected m-Fold Dominating Set.
24. A Note on the Instance Complexity of Pseudorandom Sets.
25. CCA 2009 Front Matter - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis.
26. CCA 2009 Preface - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis.
27. Integral Equations, Systems of Quadratic Equations, and Exponential-Time Completeness (Extended Abstract)
28. On the Complexity of Learning Minimum Time-Bounded Turing Machines.
29. Learning String Patterns and Tree Patterns from Examples.
30. On the Computability of Fractal Dimensions and Hausdorff Measure.
31. Problem Solving in Automata, Languages, and Complexity
32. Computational Complexity of Fixed Points and Intersection Points.
33. A Polynomial-Time Computable Curve whose Interior has a Nonrecursive Measure.
34. Computational Complexity of Two-Dimensional Regions.
35. On the longest circuit in an alterable digraph.
36. Instance Complexity.
37. A note on best fractions of a computable real number.
38. On the Computational Complexity of Integral Equations.
39. Computability and Complexity in Analysis (Dagstuhl Seminar 99461)
40. Separating the Low and High Hierarchies by Oracles
41. On Adaptive Versus Nonadaptive Bounded Query Machines.
42. Three Sigma^p_2-Complete Problems in Computational Learning Theory.
43. On the Complexity of Learning Minimum Time-Bounded Turing Machines.
44. A note on separating the relativized polynomial time hierarchy by immune sets.
45. Separating and Collapsing Results on the Relativized Probabilistic Polynomial-Time Hierarchy
46. In Memoriam Ronald V. Book.
47. Fractals and Complexity.
48. Preface: MLQ - Math. Log. Quart. 4-5/2004.
49. Instance complexity
50. Computability and Complexity in Analysis.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.