↓ Skip to main content

Computer Science – Theory and Applications

Overview of attention for book
Cover of 'Computer Science – Theory and Applications'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Type Theory and Formalisation of Mathematics
  3. Altmetric Badge
    Chapter 2 Advances in Parameterized Verification of Population Protocols
  4. Altmetric Badge
    Chapter 3 Verification of Quantum Computation and the Price of Trust
  5. Altmetric Badge
    Chapter 4 Graph Sketching and Streaming: New Approaches for Analyzing Massive Graphs
  6. Altmetric Badge
    Chapter 5 Concatenation Hierarchies: New Bottle, Old Wine
  7. Altmetric Badge
    Chapter 6 Can We Locally Compute Sparse Connected Subgraphs?
  8. Altmetric Badge
    Chapter 7 Palindromic Decompositions with Gaps and Errors
  9. Altmetric Badge
    Chapter 8 Cascade Heap: Towards Time-Optimal Extractions
  10. Altmetric Badge
    Chapter 9 Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets
  11. Altmetric Badge
    Chapter 10 Parameterized Counting of Trees, Forests and Matroid Bases
  12. Altmetric Badge
    Chapter 11 Generalized Dyck Shifts
  13. Altmetric Badge
    Chapter 12 Green’s Relations in Finite Transformation Semigroups
  14. Altmetric Badge
    Chapter 13 Nondeterministic Unitary OBDDs
  15. Altmetric Badge
    Chapter 14 Unary Coded PSPACE-Complete Languages in ASPACE(loglog n)
  16. Altmetric Badge
    Chapter 15 Turing Degree Spectra of Minimal Subshifts
  17. Altmetric Badge
    Chapter 16 Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams
  18. Altmetric Badge
    Chapter 17 Dynamic Stabbing Queries with Sub-logarithmic Local Updates for Overlapping Intervals
  19. Altmetric Badge
    Chapter 18 The Transformation Monoid of a Partially Lossy Queue
  20. Altmetric Badge
    Chapter 19 Approximation Algorithms for the Maximum Carpool Matching Problem
  21. Altmetric Badge
    Chapter 20 The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in $${{\mathsf {T}}}{{\mathsf {C}}}^0$$
  22. Altmetric Badge
    Chapter 21 On Algorithmic Statistics for Space-Bounded Algorithms
  23. Altmetric Badge
    Chapter 22 Popularity in the Generalized Hospital Residents Setting
  24. Altmetric Badge
    Chapter 23 Edit Distance Neighbourhoods of Input-Driven Pushdown Automata
  25. Altmetric Badge
    Chapter 24 The (Minimum) Rank of Typical Fooling-Set Matrices
  26. Altmetric Badge
    Chapter 25 On Probabilistic Algorithm for Solving Almost All Instances of the Set Partition Problem
  27. Altmetric Badge
    Chapter 26 Dag-Like Communication and Its Applications
  28. Altmetric Badge
    Chapter 27 The Descriptive Complexity of Subgraph Isomorphism Without Numerics
  29. Altmetric Badge
    Chapter 28 On a Generalization of Horn Constraint Systems
Attention for Chapter 25: On Probabilistic Algorithm for Solving Almost All Instances of the Set Partition Problem
Altmetric Badge

Readers on

mendeley
1 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
On Probabilistic Algorithm for Solving Almost All Instances of the Set Partition Problem
Chapter number 25
Book title
Computer Science – Theory and Applications
Published by
Springer, Cham, June 2017
DOI 10.1007/978-3-319-58747-9_25
Book ISBNs
978-3-31-958746-2, 978-3-31-958747-9
Authors

Alexandr V. Seliverstov, Seliverstov, Alexandr V.

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Other 1 100%
Readers by discipline Count As %
Materials Science 1 100%