↓ Skip to main content

Mathematical Foundations of Computer Science 2001

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 A New Category for Semantics
  3. Altmetric Badge
    Chapter 2 On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity
  4. Altmetric Badge
    Chapter 3 Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
  5. Altmetric Badge
    Chapter 4 Some Recent Results on Data Mining and Search
  6. Altmetric Badge
    Chapter 5 Hypertree Decompositions: A Survey
  7. Altmetric Badge
    Chapter 6 The Strength of Non-size-increasing Computation (Introduction and Summary)
  8. Altmetric Badge
    Chapter 7 Introduction to Recent Quantum Algorithms
  9. Altmetric Badge
    Chapter 8 Decomposition Methods and Sampling Circuits in the Cartesian Lattice
  10. Altmetric Badge
    Chapter 9 New Algorithms for k-SAT Based on the Local Search Principle
  11. Altmetric Badge
    Chapter 10 Linear Temporal Logic and Finite Semigroups
  12. Altmetric Badge
    Chapter 11 Refined Search Tree Technique for Dominating Set on Planar Graphs
  13. Altmetric Badge
    Chapter 12 The Computational Power of a Family of Decision Forests
  14. Altmetric Badge
    Chapter 13 Exact Results for Accepting Probabilities of Quantum Automata
  15. Altmetric Badge
    Chapter 14 Improved Bounds on the Weak Pigeonhole Principle and Infinitely Many Primes from Weaker Axioms
  16. Altmetric Badge
    Chapter 15 Analysis Problems for Sequential Dynamical Systems and Communicating State Machines
  17. Altmetric Badge
    Chapter 16 The Complexity of Tensor Circuit Evaluation
  18. Altmetric Badge
    Chapter 17 Computing Reciprocals of Bivariate Power Series
  19. Altmetric Badge
    Chapter 18 Automatic Verification of Recursive Procedures with One Integer Parameter
  20. Altmetric Badge
    Chapter 19 Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds
  21. Altmetric Badge
    Chapter 20 Computable Versions of Baire’s Category Theorem
  22. Altmetric Badge
    Chapter 21 Automata on Linear Orderings
  23. Altmetric Badge
    Chapter 22 Algorithmic Information Theory and Cellular Automata Dynamics
  24. Altmetric Badge
    Chapter 23 The k-Median Problem for Directed Trees
  25. Altmetric Badge
    Chapter 24 On Pseudorandom Generators in NC0
  26. Altmetric Badge
    Chapter 25 There Are No Sparse NPw-Hard Sets
  27. Altmetric Badge
    Chapter 26 Sharing One Secret vs. Sharing Many Secrets: Tight Bounds for the Max Improvement Ratio
  28. Altmetric Badge
    Chapter 27 (H,C,K) -Coloring: Fast, Easy, and Hard Cases
  29. Altmetric Badge
    Chapter 28 Randomness and Reductibility
  30. Altmetric Badge
    Chapter 29 On the Computational Complexity of Infinite Words
  31. Altmetric Badge
    Chapter 30 Lower Bounds for On-Line Single-Machine Scheduling
  32. Altmetric Badge
    Chapter 31 Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings
  33. Altmetric Badge
    Chapter 32 A 3-Approximation Algorithm for Movement Minimization in Conveyor Flow Shop Processing
  34. Altmetric Badge
    Chapter 33 Quantifier Rank for Parity of Embedded Finite Models
  35. Altmetric Badge
    Chapter 34 Space Hierarchy Theorem Revised
  36. Altmetric Badge
    Chapter 35 Converting Two—Way Nondeterministic Unary Automata into Simpler Automata
  37. Altmetric Badge
    Chapter 36 The Complexity of the Minimal Polynomial
  38. Altmetric Badge
    Chapter 37 Note on Minimal Finite Automata
  39. Altmetric Badge
    Chapter 38 Synchronizing Finite Automata on Eulerian Digraphs
  40. Altmetric Badge
    Chapter 39 A Time Hierarchy for Bounded One-Way Cellular Automata
  41. Altmetric Badge
    Chapter 40 Checking Amalgamability Conditions forCasl Architectural Specifications
  42. Altmetric Badge
    Chapter 41 On-Line Scheduling with Tight Deadlines
  43. Altmetric Badge
    Chapter 42 Complexity Note on Mixed Hypergraphs
  44. Altmetric Badge
    Chapter 43 News from the Online Traveling Repairman
  45. Altmetric Badge
    Chapter 44 Word Problems for 2-Homogeneous Monoids and Symmetric Logspace
  46. Altmetric Badge
    Chapter 45 Variations on a Theorem of Fine & Wilf
  47. Altmetric Badge
    Chapter 46 Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs
  48. Altmetric Badge
    Chapter 47 Satisfiability of Systems of Equations over Finite Monoids
  49. Altmetric Badge
    Chapter 48 Rational Graphs Trace Context-Sensitive Languages
  50. Altmetric Badge
    Chapter 49 Towards Regular Languages over Infinite Alphabets
  51. Altmetric Badge
    Chapter 50 Partial Information and Special Case Algorithms
  52. Altmetric Badge
    Chapter 51 The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs
  53. Altmetric Badge
    Chapter 52 From Bidirectionality to Alternation
  54. Altmetric Badge
    Chapter 53 Syntactic Semiring of a Language
  55. Altmetric Badge
    Chapter 54 On Reducibility and Symmetry of Disjoint NP-Pairs
  56. Altmetric Badge
    Chapter 55 Hierarchy of Monotonically Computable Real Numbers
  57. Altmetric Badge
    Chapter 56 On the Equational Definition of the Least Prefixed Point
  58. Altmetric Badge
    Chapter 57 On the Periods of Partial Words
  59. Altmetric Badge
    Chapter 58 The Size of Power Automata
  60. Altmetric Badge
    Chapter 59 On the Approximability of the Steiner Tree Problem
  61. Altmetric Badge
    Chapter 60 Alignment between Two RNA Structures
  62. Altmetric Badge
    Chapter 61 Characterization of Context-Free Languages with Polynomially Bounded Ambiguity
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

news
1 news outlet
twitter
2 X users

Citations

dimensions_citation
4 Dimensions

Readers on

mendeley
4 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.
Title
Mathematical Foundations of Computer Science 2001
Published by
Springer Science & Business Media, August 2001
DOI 10.1007/3-540-44683-4
ISBNs
978-3-54-042496-3, 978-3-54-044683-5
Editors

Sgall, Jiří, Pultr, Aleš, Kolman, Petr

X Demographics

X Demographics

The data shown below were collected from the profiles of 2 X users 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 4 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 4 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 25%
Unknown 3 75%
Readers by discipline Count As %
Computer Science 1 25%
Unknown 3 75%