↓ Skip to main content

Mathematical Foundations of Computer Science 1977

Overview of attention for book
Cover of 'Mathematical Foundations of Computer Science 1977'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 123 On the structure and properties of NP-complete problems and their associated optimization problems
  3. Altmetric Badge
    Chapter 124 A comparative review of some program verification methods
  4. Altmetric Badge
    Chapter 125 Classification of the context-free languages
  5. Altmetric Badge
    Chapter 126 Finite automaton from a flowchart scheme point of view
  6. Altmetric Badge
    Chapter 127 A new type of models of computation
  7. Altmetric Badge
    Chapter 128 Correctness of mixed computation in ALGOL-like programs
  8. Altmetric Badge
    Chapter 129 Algebra and logic in theoretical computer science
  9. Altmetric Badge
    Chapter 130 A survey of recent problems and results in analytic computational complexity
  10. Altmetric Badge
    Chapter 131 Tree-structures for set manipulation problems
  11. Altmetric Badge
    Chapter 132 Applied algorithmic logic
  12. Altmetric Badge
    Chapter 133 Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials
  13. Altmetric Badge
    Chapter 134 Frequency algorithms and computations
  14. Altmetric Badge
    Chapter 135 Graph-theoretic arguments in low-level complexity
  15. Altmetric Badge
    Chapter 136 Properties of complexity classes a short survey
  16. Altmetric Badge
    Chapter 137 A uniform approach to inductive posets and inductive closure
  17. Altmetric Badge
    Chapter 138 Generalized probabilistic grammars
  18. Altmetric Badge
    Chapter 139 Classes of structurally isomorphic np-optimization problems
  19. Altmetric Badge
    Chapter 140 Pushdown-automata and families of languages generating cylinders
  20. Altmetric Badge
    Chapter 141 Semantics of infinite processes using generalized trees
  21. Altmetric Badge
    Chapter 142 Characterization of recognizable families by means of regular languages
  22. Altmetric Badge
    Chapter 143 An algebraic approach to problem solution and problem semantics
  23. Altmetric Badge
    Chapter 144 Complexity and minimality of context-free grammars and languages
  24. Altmetric Badge
    Chapter 145 Comparison of the active visiting and the crossing complexities
  25. Altmetric Badge
    Chapter 146 Arithmetical complexity of some problems in computer science
  26. Altmetric Badge
    Chapter 147 Formal transformations and the development of programs
  27. Altmetric Badge
    Chapter 148 Optimal rasp programs for arbitrarily complex 0–1 valued functions
  28. Altmetric Badge
    Chapter 149 The expressive power of intensional logic in the semantics of programming languages
  29. Altmetric Badge
    Chapter 150 On the complexity of equivalent transformations in programming languages
  30. Altmetric Badge
    Chapter 151 Schematology in a MJ I/T I-language OPT imizer
  31. Altmetric Badge
    Chapter 152 Decidability (undecidability) of equivalence of Minsky machines with components consisting of at most seven (eight) instructions
  32. Altmetric Badge
    Chapter 153 A top-down no backtrack parsing of general context-free languages
  33. Altmetric Badge
    Chapter 154 A probabilistic restriction of branching plans
  34. Altmetric Badge
    Chapter 155 Reducing operators for normed general formal systems
  35. Altmetric Badge
    Chapter 156 Invariant properties of informational bulks
  36. Altmetric Badge
    Chapter 157 Two decidability results for deterministic pushdown automata
  37. Altmetric Badge
    Chapter 158 On the logic of incomplete information
  38. Altmetric Badge
    Chapter 159 Measures of ambiguity in the analysis of complex systems
  39. Altmetric Badge
    Chapter 160 Two-level meta-controlled substitution grammars
  40. Altmetric Badge
    Chapter 161 A calculus to build up correct programs
  41. Altmetric Badge
    Chapter 162 Another approach for proving program correctness
  42. Altmetric Badge
    Chapter 163 Cover results and normal forms
  43. Altmetric Badge
    Chapter 164 On a deterministic subclass of context-free languages
  44. Altmetric Badge
    Chapter 165 Exponential optimization for the LLP(k) parsing method
  45. Altmetric Badge
    Chapter 166 The medial axis of a simple polygon
  46. Altmetric Badge
    Chapter 167 Semantics and proof rules for coroutine hierarchies in block-structured programming languages
  47. Altmetric Badge
    Chapter 168 Acceptors for iteration languages
  48. Altmetric Badge
    Chapter 169 How good is the adversary lower bound ?
  49. Altmetric Badge
    Chapter 170 Total correctness for procedures
  50. Altmetric Badge
    Chapter 171 A model for retrieval systems and some mathematical problems behind
  51. Altmetric Badge
    Chapter 172 Time and tape bounded auxiliary pushdown automata
  52. Altmetric Badge
    Chapter 173 A fast non-commutative algorithm for matrix multiplication
  53. Altmetric Badge
    Chapter 174 Fixed-points and algebras with infinitely long expressions, I
  54. Altmetric Badge
    Chapter 175 On languages, accepted by machines in the category of sets
  55. Altmetric Badge
    Chapter 176 Real time computations with restrictions on tape alphabet
  56. Altmetric Badge
    Chapter 177 The bodnarchuk metric space of languages and the topology of the learning space
  57. Altmetric Badge
    Chapter 178 Complexity hierarchies of oracles
  58. Altmetric Badge
    Chapter 179 Determining processes by violations
  59. Altmetric Badge
    Chapter 180 The influence of the machine model on the time complexity of context-free language recognition
  60. Altmetric Badge
    Chapter 181 A generalized computability thesis
  61. Altmetric Badge
    Chapter 182 Identification of formal languages
  62. Altmetric Badge
    Chapter 183 Correctness of recursive flow diagram programs
Attention for Chapter 135: Graph-theoretic arguments in low-level complexity
Altmetric Badge

About this Attention Score

  • High Attention Score compared to outputs of the same age (90th percentile)

Mentioned by

blogs
1 blog

Readers on

mendeley
19 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
Graph-theoretic arguments in low-level complexity
Chapter number 135
Book title
Mathematical Foundations of Computer Science 1977
Published in
Lecture notes in computer science, January 1977
DOI 10.1007/3-540-08353-7_135
Book ISBNs
978-3-54-008353-5, 978-3-54-037285-1
Authors

Leslie G. Valiant

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Russia 2 11%
Japan 1 5%
India 1 5%
United States 1 5%
Unknown 14 74%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 5 26%
Researcher 5 26%
Student > Master 4 21%
Student > Bachelor 1 5%
Professor 1 5%
Other 2 11%
Unknown 1 5%
Readers by discipline Count As %
Computer Science 15 79%
Mathematics 2 11%
Physics and Astronomy 1 5%
Unknown 1 5%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 6. 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 16 March 2011.
All research outputs
#5,688,684
of 22,711,645 outputs
Outputs from Lecture notes in computer science
#1,858
of 8,124 outputs
Outputs of similar age
#2,268
of 23,117 outputs
Outputs of similar age from Lecture notes in computer science
#1
of 2 outputs
Altmetric has tracked 22,711,645 research outputs across all sources so far. This one has received more attention than most of these and is in the 74th percentile.
So far Altmetric has tracked 8,124 research outputs from this source. They receive a mean Attention Score of 5.0. This one has done well, scoring higher than 77% of its peers.
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 23,117 tracked outputs that were published within six weeks on either side of this one in any source. This one has done particularly well, scoring higher than 90% of its contemporaries.
We're also able to compare this research output to 2 others from the same source and published within six weeks on either side of this one. This one has scored higher than all of them