↓ Skip to main content

Automata, Languages, and Programming

Overview of attention for book
Cover of 'Automata, Languages, and Programming'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Statistical Randomized Encodings: A Complexity Theoretic View
  3. Altmetric Badge
    Chapter 2 Tighter Fourier Transform Lower Bounds
  4. Altmetric Badge
    Chapter 3 Quantifying Competitiveness in Paging with Locality of Reference
  5. Altmetric Badge
    Chapter 4 Approximation Algorithms for Computing Maximin Share Allocations
  6. Altmetric Badge
    Chapter 5 Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare
  7. Altmetric Badge
    Chapter 6 Batched Point Location in SINR Diagrams via Algebraic Tools
  8. Altmetric Badge
    Chapter 7 On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs
  9. Altmetric Badge
    Chapter 8 Serving in the Dark should be done Non-Uniformly
  10. Altmetric Badge
    Chapter 9 Finding the Median (Obliviously) with Bounded Space
  11. Altmetric Badge
    Chapter 10 Approximation Algorithms for Min-Sum k -Clustering and Balanced k -Median
  12. Altmetric Badge
    Chapter 11 Solving Linear Programming with Constraints Unknown
  13. Altmetric Badge
    Chapter 12 Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources
  14. Altmetric Badge
    Chapter 13 Limitations of Algebraic Approaches to Graph Isomorphism Testing
  15. Altmetric Badge
    Chapter 14 Fully Dynamic Matching in Bipartite Graphs
  16. Altmetric Badge
    Chapter 15 Feasible Interpolation for QBF Resolution Calculi
  17. Altmetric Badge
    Chapter 16 Simultaneous Approximation of Constraint Satisfaction Problems
  18. Altmetric Badge
    Chapter 17 Design of Dynamic Algorithms via Primal-Dual Method
  19. Altmetric Badge
    Chapter 18 What Percentage of Programs Halt?
  20. Altmetric Badge
    Chapter 19 The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems
  21. Altmetric Badge
    Chapter 20 Spotting Trees with Few Leaves
  22. Altmetric Badge
    Chapter 21 Constraint Satisfaction Problems over the Integers with Successor
  23. Altmetric Badge
    Chapter 22 Hardness Amplification and the Approximate Degree of Constant-Depth Circuits
  24. Altmetric Badge
    Chapter 23 Algorithms and Complexity for Turaev-Viro Invariants
  25. Altmetric Badge
    Chapter 24 Big Data on the Rise?
  26. Altmetric Badge
    Chapter 25 Unit Interval Editing is Fixed-Parameter Tractable
  27. Altmetric Badge
    Chapter 26 Streaming Algorithms for Submodular Function Maximization
  28. Altmetric Badge
    Chapter 27 Multilinear Pseudorandom Functions
  29. Altmetric Badge
    Chapter 28 Zero-Fixing Extractors for Sub-Logarithmic Entropy
  30. Altmetric Badge
    Chapter 29 Interactive Proofs with Approximately Commuting Provers
  31. Altmetric Badge
    Chapter 30 Popular matchings with two-sided preferences and one-sided ties
  32. Altmetric Badge
    Chapter 31 Block Interpolation: A Framework for Tight Exponential-Time Counting Complexity
  33. Altmetric Badge
    Chapter 32 On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols
  34. Altmetric Badge
    Chapter 33 Scheduling Bidirectional Traffic on a Path
  35. Altmetric Badge
    Chapter 34 On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace
  36. Altmetric Badge
    Chapter 35 On Planar Boolean CSP
  37. Altmetric Badge
    Chapter 36 On Temporal Graph Exploration
  38. Altmetric Badge
    Chapter 37 Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation
  39. Altmetric Badge
    Chapter 38 A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
  40. Altmetric Badge
    Chapter 39 Lower Bounds for the Graph Homomorphism Problem
  41. Altmetric Badge
    Chapter 40 Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree
  42. Altmetric Badge
    Chapter 41 Relative Discrepancy Does not Separate Information and Communication Complexity
  43. Altmetric Badge
    Chapter 42 A Galois Connection for Valued Constraint Languages of Infinite Size
  44. Altmetric Badge
    Chapter 43 Approximately Counting H -Colourings is $$\#\mathrm {BIS}$$ # BIS -Hard
  45. Altmetric Badge
    Chapter 44 Taylor Polynomial Estimator for Estimating Frequency Moments
  46. Altmetric Badge
    Chapter 45 ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria
  47. Altmetric Badge
    Chapter 46 Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets
  48. Altmetric Badge
    Chapter 47 Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search
  49. Altmetric Badge
    Chapter 48 Optimal Encodings for Range Top- $$k$$ k , Selection, and Min-Max
  50. Altmetric Badge
    Chapter 49 2-Vertex Connectivity in Directed Graphs
  51. Altmetric Badge
    Chapter 50 Ground State Connectivity of Local Hamiltonians
  52. Altmetric Badge
    Chapter 51 Uniform Kernelization Complexity of Hitting Forbidden Minors
  53. Altmetric Badge
    Chapter 52 Counting Homomorphisms to Square-Free Graphs, Modulo 2
  54. Altmetric Badge
    Chapter 53 Approximately Counting Locally-Optimal Structures
  55. Altmetric Badge
    Chapter 54 Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs
  56. Altmetric Badge
    Chapter 55 Fast Algorithms for Diameter-Optimally Augmenting Paths
  57. Altmetric Badge
    Chapter 56 Hollow Heaps
  58. Altmetric Badge
    Chapter 57 Linear-Time List Recovery of High-Rate Expander Codes
  59. Altmetric Badge
    Chapter 58 Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time
  60. Altmetric Badge
    Chapter 59 Automata, Languages, and Programming
  61. Altmetric Badge
    Chapter 60 Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities
  62. Altmetric Badge
    Chapter 61 Local Reductions
  63. Altmetric Badge
    Chapter 62 Query Complexity in Expectation
  64. Altmetric Badge
    Chapter 63 Near-Linear Query Complexity for Graph Inference
  65. Altmetric Badge
    Chapter 64 A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set
  66. Altmetric Badge
    Chapter 65 Finding a Path in Group-Labeled Graphs with Two Labels Forbidden
  67. Altmetric Badge
    Chapter 66 Lower Bounds for Sums of Powers of Low Degree Univariates
  68. Altmetric Badge
    Chapter 67 Approximating CSPs Using LP Relaxation
  69. Altmetric Badge
    Chapter 68 Comparator Circuits over Finite Bounded Posets
  70. Altmetric Badge
    Chapter 69 Algebraic Properties of Valued Constraint Satisfaction Problem
  71. Altmetric Badge
    Chapter 70 Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic
  72. Altmetric Badge
    Chapter 71 On the Hardest Problem Formulations for the $$0/1$$ 0 / 1 Lasserre Hierarchy
  73. Altmetric Badge
    Chapter 72 Replacing Mark Bits with Randomness in Fibonacci Heaps
  74. Altmetric Badge
    Chapter 73 A PTAS for the Weighted Unit Disk Cover Problem
  75. Altmetric Badge
    Chapter 74 Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points
  76. Altmetric Badge
    Chapter 75 Deterministic Truncation of Linear Matroids
  77. Altmetric Badge
    Chapter 76 Linear Time Parameterized Algorithms for Subset Feedback Vertex Set
  78. Altmetric Badge
    Chapter 77 An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
  79. Altmetric Badge
    Chapter 78 Amplification of One-Way Information Complexity via Codes and Noise Sensitivity
  80. Altmetric Badge
    Chapter 79 A $$(2+\epsilon )$$ ( 2 + ϵ ) -Approximation Algorithm for the Storage Allocation Problem
  81. Altmetric Badge
    Chapter 80 Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas
  82. Altmetric Badge
    Chapter 81 Computing the Fréchet Distance Between Polygons with Holes
  83. Altmetric Badge
    Chapter 82 An Improved Private Mechanism for Small Databases
  84. Altmetric Badge
    Chapter 83 Binary Pattern Tile Set Synthesis Is NP-hard
  85. Altmetric Badge
    Chapter 84 Near-Optimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity
  86. Altmetric Badge
    Chapter 85 Condensed Unpredictability
  87. Altmetric Badge
    Chapter 86 Sherali-Adams Relaxations for Valued CSPs
  88. Altmetric Badge
    Chapter 87 Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm
  89. Altmetric Badge
    Chapter 88 The Simultaneous Communication of Disjointness with Applications to Data Streams
  90. Altmetric Badge
    Chapter 89 An Improved Combinatorial Algorithm for Boolean Matrix Multiplication
Attention for Chapter 50: Ground State Connectivity of Local Hamiltonians
Altmetric Badge

About this Attention Score

  • Average Attention Score compared to outputs of the same age
  • Above-average Attention Score compared to outputs of the same age and source (53rd percentile)

Mentioned by

twitter
2 tweeters

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
30 Mendeley
citeulike
1 CiteULike
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
Ground State Connectivity of Local Hamiltonians
Chapter number 50
Book title
Automata, Languages, and Programming
Published in
arXiv, July 2015
DOI 10.1007/978-3-662-47672-7_50
Book ISBNs
978-3-66-247671-0, 978-3-66-247672-7
Authors

Sevag Gharibian, Jamie Sikora, Gharibian, Sevag, Sikora, Jamie

Twitter Demographics

The data shown below were collected from the profiles of 2 tweeters who shared this research output. Click here to find out more about how the information was compiled.

Mendeley readers

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

Geographical breakdown

Country Count As %
United States 1 3%
Vietnam 1 3%
Unknown 28 93%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 8 27%
Researcher 6 20%
Student > Doctoral Student 3 10%
Student > Master 3 10%
Student > Bachelor 2 7%
Other 7 23%
Unknown 1 3%
Readers by discipline Count As %
Physics and Astronomy 16 53%
Computer Science 13 43%
Unknown 1 3%

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 17 December 2014.
All research outputs
#11,070,847
of 14,563,402 outputs
Outputs from arXiv
#280,532
of 569,766 outputs
Outputs of similar age
#125,465
of 202,063 outputs
Outputs of similar age from arXiv
#3,514
of 11,023 outputs
Altmetric has tracked 14,563,402 research outputs across all sources so far. This one is in the 20th percentile – i.e., 20% of other outputs scored the same or lower than it.
So far Altmetric has tracked 569,766 research outputs from this source. They receive a mean Attention Score of 3.8. This one is in the 38th percentile – i.e., 38% 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 202,063 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 32nd percentile – i.e., 32% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 11,023 others from the same source and published within six weeks on either side of this one. This one has gotten more attention than average, scoring higher than 53% of its contemporaries.