↓ Skip to main content

Computing and Combinatorics

Overview of attention for book
Cover of 'Computing and Combinatorics'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Derandomizing HSSW Algorithm for 3-SAT
  3. Altmetric Badge
    Chapter 2 Dominating Set Counting in Graph Classes
  4. Altmetric Badge
    Chapter 3 The Density Maximization Problem in Graphs
  5. Altmetric Badge
    Chapter 4 FlipCut Supertrees: Towards Matrix Representation Accuracy in Polynomial Time
  6. Altmetric Badge
    Chapter 5 Tight Bounds on Local Search to Approximate the Maximum Satisfiability Problems
  7. Altmetric Badge
    Chapter 6 Parameterized Complexity in Multiple-Interval Graphs: Partition, Separation, Irredundancy
  8. Altmetric Badge
    Chapter 7 Exact Parameterized Multilinear Monomial Counting via k -Layer Subset Convolution and k -Disjoint Sum
  9. Altmetric Badge
    Chapter 8 On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms
  10. Altmetric Badge
    Chapter 9 On Parameterized Independent Feedback Vertex Set
  11. Altmetric Badge
    Chapter 10 Cograph Editing: Complexity and Parameterized Algorithms
  12. Altmetric Badge
    Chapter 11 Approximation Complexity of Complex-Weighted Degree-Two Counting Constraint Satisfaction Problems
  13. Altmetric Badge
    Chapter 12 Strong I/O Lower Bounds for Binomial and FFT Computation Graphs
  14. Altmetric Badge
    Chapter 13 Spin Systems on Graphs with Complex Edge Functions and Specified Degree Regularities
  15. Altmetric Badge
    Chapter 14 Quantum algorithm for the Boolean hidden shift problem
  16. Altmetric Badge
    Chapter 15 A Kolmogorov Complexity Proof of the Lovász Local Lemma for Satisfiability
  17. Altmetric Badge
    Chapter 16 Proper n -Cell Polycubes in n  − 3 Dimensions
  18. Altmetric Badge
    Chapter 17 Largest Area Convex Hull of Axis-Aligned Squares Based on Imprecise Data
  19. Altmetric Badge
    Chapter 18 Improved Algorithms for the Point-Set Embeddability Problem for Plane 3-Trees
  20. Altmetric Badge
    Chapter 19 Optimal Strategies for the One-Round Discrete Voronoi Game on a Line
  21. Altmetric Badge
    Chapter 20 Computing the Girth of a Planar Graph in Linear Time
  22. Altmetric Badge
    Chapter 21 Diagonalization Strikes Back: Some Recent Lower Bounds in Complexity Theory
  23. Altmetric Badge
    Chapter 22 Unions of Disjoint NP-Complete Sets
  24. Altmetric Badge
    Chapter 23 ReachFewL = ReachUL
  25. Altmetric Badge
    Chapter 24 (1 +  ε )-Competitive Algorithm for Online OVSF Code Assignment with Resource Augmentation
  26. Altmetric Badge
    Chapter 25 Scheduling Jobs on Heterogeneous Platforms
  27. Altmetric Badge
    Chapter 26 Self-assembling Rulers for Approximating Generalized Sierpinski Carpets
  28. Altmetric Badge
    Chapter 27 Approximately Uniform Online Checkpointing
  29. Altmetric Badge
    Chapter 28 Bandwidth of Convex Bipartite Graphs and Related Graphs
  30. Altmetric Badge
    Chapter 29 Algorithms for Partition of Some Class of Graphs under Compaction
  31. Altmetric Badge
    Chapter 30 A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition
  32. Altmetric Badge
    Chapter 31 Matching and P 2-Packing: Weighted Versions
  33. Altmetric Badge
    Chapter 32 On Totally Unimodularity of Edge-Edge Adjacency Matrices
  34. Altmetric Badge
    Chapter 33 The Topology Aware File Distribution Problem
  35. Altmetric Badge
    Chapter 34 Exploiting the Robustness on Power-Law Networks
  36. Altmetric Badge
    Chapter 35 Competitive Algorithms for Online Pricing
  37. Altmetric Badge
    Chapter 36 Making Abstraction-Refinement Efficient in Model Checking
  38. Altmetric Badge
    Chapter 37 An Integer Programming Approach for the Rural Postman Problem with Time Dependent Travel Times
  39. Altmetric Badge
    Chapter 38 Property Testing for Cyclic Groups and Beyond
  40. Altmetric Badge
    Chapter 39 Canonizing Hypergraphs under Abelian Group Action
  41. Altmetric Badge
    Chapter 40 Linear Time Algorithms for the Basis of Abelian Groups
  42. Altmetric Badge
    Chapter 41 Characterizations of Locally Testable Linear- and Affine-Invariant Families
  43. Altmetric Badge
    Chapter 42 A New Conditionally Anonymous Ring Signature
  44. Altmetric Badge
    Chapter 43 On the Right-Seed Array of a String
  45. Altmetric Badge
    Chapter 44 Compressed Directed Acyclic Word Graph with Application in Local Alignment
  46. Altmetric Badge
    Chapter 45 Unavoidable Regularities in Long Words with Bounded Number of Symbol Occurrences
  47. Altmetric Badge
    Chapter 46 Summing Symbols in Mutual Recurrences
  48. Altmetric Badge
    Chapter 47 Flipping Triangles and Rectangles
  49. Altmetric Badge
    Chapter 48 Unconstrained and Constrained Fault-Tolerant Resource Allocation
  50. Altmetric Badge
    Chapter 49 Finding Paths with Minimum Shared Edges
  51. Altmetric Badge
    Chapter 50 Combinatorial Group Testing for Corruption Localizing Hashing
  52. Altmetric Badge
    Chapter 51 Task Ordering and Memory Management Problem for Degree of Parallelism Estimation
  53. Altmetric Badge
    Chapter 52 Computing Majority with Triple Queries
  54. Altmetric Badge
    Chapter 53 A New Variation of Hat Guessing Games
  55. Altmetric Badge
    Chapter 54 Oblivious Transfer and n-Variate Linear Function Evaluation
  56. Altmetric Badge
    Chapter 55 Optimal Online Algorithms on Two Hierarchical Machines with Resource Augmentation
Attention for Chapter 14: Quantum algorithm for the Boolean hidden shift problem
Altmetric Badge

About this Attention Score

  • Average Attention Score compared to outputs of the same age and source

Mentioned by

twitter
1 X user

Readers on

mendeley
10 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
Quantum algorithm for the Boolean hidden shift problem
Chapter number 14
Book title
Computing and Combinatorics
Published in
Lecture notes in computer science, January 2011
DOI 10.1007/978-3-642-22685-4_14
Book ISBNs
978-3-64-222684-7, 978-3-64-222685-4
Authors

Dmitry Gavinsky, Martin Roetteler, Jérémie Roland, Gavinsky, Dmitry, Roetteler, Martin, Roland, Jérémie

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Poland 1 10%
Belgium 1 10%
Unknown 8 80%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 3 30%
Student > Master 2 20%
Researcher 2 20%
Professor 1 10%
Student > Postgraduate 1 10%
Other 0 0%
Unknown 1 10%
Readers by discipline Count As %
Mathematics 3 30%
Computer Science 3 30%
Physics and Astronomy 3 30%
Unknown 1 10%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 1. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 10 January 2012.
All research outputs
#15,241,259
of 22,661,413 outputs
Outputs from Lecture notes in computer science
#4,645
of 8,123 outputs
Outputs of similar age
#140,035
of 180,272 outputs
Outputs of similar age from Lecture notes in computer science
#149
of 318 outputs
Altmetric has tracked 22,661,413 research outputs across all sources so far. This one is in the 22nd percentile – i.e., 22% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,123 research outputs from this source. They receive a mean Attention Score of 5.0. This one is in the 27th percentile – i.e., 27% of its peers scored the same or lower than it.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 180,272 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 12th percentile – i.e., 12% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 318 others from the same source and published within six weeks on either side of this one. This one is in the 30th percentile – i.e., 30% of its contemporaries scored the same or lower than it.