Search

Your search keyword '"Podolskii, Vladimir V."' showing total 35 results

Search Constraints

Start Over You searched for: Author "Podolskii, Vladimir V." Remove constraint Author: "Podolskii, Vladimir V." Database Springer Nature eBooks Remove constraint Database: Springer Nature eBooks
35 results on '"Podolskii, Vladimir V."'

Search Results

1. On the Decision Tree Complexity of Threshold Functions

2. Tropical Combinatorial Nullstellensatz and Fewnomials Testing

3. Circuit Complexity Meets Ontology-Based Data Access

4. Polynomial Threshold Functions and Boolean Threshold Circuits

5. Lower Bound on Weights of Large Degree Threshold Functions

6. Weights of Exact Threshold Functions

7. A Uniform Lower Bound on Weights of Perceptrons

8. Perceptrons of Large Weight

9. Online Labeling: Algorithms, Lower Bounds and Open Questions

10. Quadratically Tight Relations for Randomized Query Complexity

11. Structural Parameterizations of Dominating Set Variants

12. Periodicity in Data Streams with Wildcards

13. Can We Create Large k-Cores by Adding Few Edges?

14. A Tight Lower Bound for Steiner Orientation

15. Distributed Symmetry-Breaking Algorithms for Congested Cliques

16. The Clever Shopper Problem

17. Lower Bounds for Unrestricted Boolean Circuits: Open Problems

18. Maintaining Chordal Graphs Dynamically: Improved Upper and Lower Bounds

19. A New Algorithm for Finding Closest Pair of Vectors (Extended Abstract)

20. On the Decision Trees with Symmetries

21. On Strong NP-Completeness of Rational Problems

22. Facility Location on Planar Graphs with Unreliable Links

23. On Emptiness and Membership Problems for Set Automata

24. Slopes of 3-Dimensional Subshifts of Finite Type

25. Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing

26. Max-Cut Above Spanning Tree is Fixed-Parameter Tractable

27. Complexity of Generation

28. Recognizing Read-Once Functions from Depth-Three Formulas

29. On Vertex Coloring Without Monochromatic Triangles

30. Complement for Two-Way Alternating Automata

31. Closure Under Reversal of Languages over Infinite Alphabets

32. Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized

33. Operations on Boolean and Alternating Finite Automata

34. Grammar-Based Compression of Unranked Trees

35. Maximum Colorful Cycles in Vertex-Colored Graphs

Catalog

Books, media, physical & digital resources