↓ Skip to main content

Mathematical Foundations of Computer Science 2005

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Page Migration in Dynamic Networks
  3. Altmetric Badge
    Chapter 2 Knot Theory, Jones Polynomial and Quantum Computing
  4. Altmetric Badge
    Chapter 3 Interactive Algorithms 2005
  5. Altmetric Badge
    Chapter 4 Some Computational Issues in Membrane Computing
  6. Altmetric Badge
    Chapter 5 The Generalization of Dirac’s Theorem for Hypergraphs
  7. Altmetric Badge
    Chapter 6 On the Communication Complexity of Co-linearity Problems
  8. Altmetric Badge
    Chapter 7 An Invitation to Play
  9. Altmetric Badge
    Chapter 8 The Complexity of Satisfiability Problems: Refining Schaefer’s Theorem
  10. Altmetric Badge
    Chapter 9 On the Number of Random Digits Required in MonteCarlo Integration of Definable Functions
  11. Altmetric Badge
    Chapter 10 Pure Nash Equilibria in Games with a Large Number of Actions
  12. Altmetric Badge
    Chapter 11 On the Complexity of Depth-2 Circuits with Threshold Gates
  13. Altmetric Badge
    Chapter 12 Isomorphic Implication
  14. Altmetric Badge
    Chapter 13 Abstract Numeration Systems and Tilings
  15. Altmetric Badge
    Chapter 14 Adversarial Queueing Model for Continuous Network Dynamics
  16. Altmetric Badge
    Chapter 15 Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
  17. Altmetric Badge
    Chapter 16 Regular Sets of Higher-Order Pushdown Stacks
  18. Altmetric Badge
    Chapter 17 Linearly Bounded Infinite Graphs
  19. Altmetric Badge
    Chapter 18 Basic Properties for Sand Automata
  20. Altmetric Badge
    Chapter 19 A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs
  21. Altmetric Badge
    Chapter 20 Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix
  22. Altmetric Badge
    Chapter 21 New Resource Augmentation Analysis of the Total Stretch of SRPT and SJF in Multiprocessor Scheduling
  23. Altmetric Badge
    Chapter 22 Approximating Polygonal Objects by Deformable Smooth Surfaces
  24. Altmetric Badge
    Chapter 23 Mathematical Foundations of Computer Science 2005
  25. Altmetric Badge
    Chapter 24 Asynchronous Deterministic Rendezvous in Graphs
  26. Altmetric Badge
    Chapter 25 Zeta-Dimension
  27. Altmetric Badge
    Chapter 26 Online Interval Coloring with Packing Constraints
  28. Altmetric Badge
    Chapter 27 Separating the Notions of Self- and Autoreducibility
  29. Altmetric Badge
    Chapter 28 Fully Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata
  30. Altmetric Badge
    Chapter 29 Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs
  31. Altmetric Badge
    Chapter 30 Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms
  32. Altmetric Badge
    Chapter 31 Packing Weighted Rectangles into a Square
  33. Altmetric Badge
    Chapter 32 Nondeterministic Graph Searching: From Pathwidth to Treewidth
  34. Altmetric Badge
    Chapter 33 Goals in the Propositional Horn ⊃  Language Are Monotone Boolean Circuits
  35. Altmetric Badge
    Chapter 34 Autoreducibility, Mitoticity, and Immunity
  36. Altmetric Badge
    Chapter 35 Canonical Disjoint NP-Pairs of Propositional Proof Systems
  37. Altmetric Badge
    Chapter 36 Complexity of DNF and Isomorphism of Monotone Formulas
  38. Altmetric Badge
    Chapter 37 The Expressive Power of Two-Variable Least Fixed-Point Logics
  39. Altmetric Badge
    Chapter 38 Languages Representable by Vertex-Labeled Graphs
  40. Altmetric Badge
    Chapter 39 On the Complexity of Mixed Discriminants and Related Problems
  41. Altmetric Badge
    Chapter 40 Two Logical Hierarchies of Optimization Problems over the Real Numbers
  42. Altmetric Badge
    Chapter 41 Algebras as Knowledge Structures
  43. Altmetric Badge
    Chapter 42 Combining Self-reducibility and Partial Information Algorithms
  44. Altmetric Badge
    Chapter 43 Mathematical Foundations of Computer Science 2005
  45. Altmetric Badge
    Chapter 44 Basic Mereology with Equivalence Relations
  46. Altmetric Badge
    Chapter 45 Online and Dynamic Recognition of Squarefree Strings
  47. Altmetric Badge
    Chapter 46 Shrinking Restarting Automata
  48. Altmetric Badge
    Chapter 47 Removing Bidirectionality from Nondeterministic Finite Automata
  49. Altmetric Badge
    Chapter 48 Generating All Minimal Integral Solutions to Monotone ∧,∨-Systems of Linear, Transversal and Polymatroid Inequalities
  50. Altmetric Badge
    Chapter 49 On the Parameterized Complexity of Exact Satisfiability Problems
  51. Altmetric Badge
    Chapter 50 Approximating Reversal Distance for Strings with Bounded Number of Duplicates
  52. Altmetric Badge
    Chapter 51 Mathematical Foundations of Computer Science 2005
  53. Altmetric Badge
    Chapter 52 An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems
  54. Altmetric Badge
    Chapter 53 Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing
  55. Altmetric Badge
    Chapter 54 Tight Approximability Results for the Maximum Solution Equation Problem over Z p
  56. Altmetric Badge
    Chapter 55 The Complexity of Model Checking Higher Order Fixpoint Logic
  57. Altmetric Badge
    Chapter 56 An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules
  58. Altmetric Badge
    Chapter 57 Inverse Monoids: Decidability and Complexity of Algebraic Questions
  59. Altmetric Badge
    Chapter 58 Dimension Is Compression
  60. Altmetric Badge
    Chapter 59 Concurrent Automata vs. Asynchronous Systems
  61. Altmetric Badge
    Chapter 60 Completeness and Degeneracy in Information Dynamics of Cellular Automata
  62. Altmetric Badge
    Chapter 61 Strict Language Inequalities and Their Decision Problems
  63. Altmetric Badge
    Chapter 62 Event Structures for the Collective Tokens Philosophy of Inhibitor Nets
  64. Altmetric Badge
    Chapter 63 An Exact 2.9416n Algorithm for the Three Domatic Number Problem
  65. Altmetric Badge
    Chapter 64 D-Width: A More Natural Measure for Directed Tree Width
  66. Altmetric Badge
    Chapter 65 On Beta-Shifts Having Arithmetical Languages
  67. Altmetric Badge
    Chapter 66 A BDD-Representation for the Logic of Equality and Uninterpreted Functions
  68. Altmetric Badge
    Chapter 67 On Small Hard Leaf Languages
  69. Altmetric Badge
    Chapter 68 Explicit Inapproximability Bounds for the Shortest Superstring Problem
  70. Altmetric Badge
    Chapter 69 Stratified Boolean Grammars
Attention for Chapter 39: On the Complexity of Mixed Discriminants and Related Problems
Altmetric Badge

About this Attention Score

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

Mentioned by

wikipedia
1 Wikipedia page

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
15 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 the Complexity of Mixed Discriminants and Related Problems
Chapter number 39
Book title
Mathematical Foundations of Computer Science 2005
Published in
Lecture notes in computer science, January 2005
DOI 10.1007/11549345_39
Book ISBNs
978-3-54-028702-5, 978-3-54-031867-5
Authors

Leonid Gurvits, Gurvits, Leonid

Editors

Joanna Jȩdrzejowicz, Andrzej Szepietowski

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Japan 1 7%
United States 1 7%
Unknown 13 87%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 6 40%
Researcher 3 20%
Student > Doctoral Student 2 13%
Student > Bachelor 1 7%
Other 1 7%
Other 1 7%
Unknown 1 7%
Readers by discipline Count As %
Computer Science 6 40%
Physics and Astronomy 4 27%
Mathematics 2 13%
Chemistry 1 7%
Engineering 1 7%
Other 0 0%
Unknown 1 7%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 3. 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 22 July 2019.
All research outputs
#7,479,767
of 22,865,319 outputs
Outputs from Lecture notes in computer science
#2,486
of 8,127 outputs
Outputs of similar age
#36,069
of 139,825 outputs
Outputs of similar age from Lecture notes in computer science
#49
of 132 outputs
Altmetric has tracked 22,865,319 research outputs across all sources so far. This one is in the 44th percentile – i.e., 44% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,127 research outputs from this source. They receive a mean Attention Score of 5.0. This one has gotten more attention than average, scoring higher than 55% 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 139,825 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 17th percentile – i.e., 17% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 132 others from the same source and published within six weeks on either side of this one. This one is in the 37th percentile – i.e., 37% of its contemporaries scored the same or lower than it.