↓ Skip to main content

Theoretical Computer Science

Overview of attention for book
Cover of 'Theoretical Computer Science'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Zero-Suppressed Binary Decision Diagrams Resilient to Index Faults
  3. Altmetric Badge
    Chapter 2 On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs
  4. Altmetric Badge
    Chapter 3 Perfect Pipelining for Streaming Large File in Peer-to-Peer Networks
  5. Altmetric Badge
    Chapter 4 Theoretical Computer Science
  6. Altmetric Badge
    Chapter 5 Online Scheduling of Unit Length Jobs with Commitment and Penalties
  7. Altmetric Badge
    Chapter 6 The Lazy Matroid Problem
  8. Altmetric Badge
    Chapter 7 Treewidth Computation and Kernelization in the Parallel External Memory Model
  9. Altmetric Badge
    Chapter 8 Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic
  10. Altmetric Badge
    Chapter 9 Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once Functions
  11. Altmetric Badge
    Chapter 10 Subshifts, MSO Logic, and Collapsing Hierarchies
  12. Altmetric Badge
    Chapter 11 Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds’ Algorithm
  13. Altmetric Badge
    Chapter 12 Not All Multi-Valued Partial CFL Functions Are Refined by Single-Valued Functions (Extended Abstract)
  14. Altmetric Badge
    Chapter 13 Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus
  15. Altmetric Badge
    Chapter 14 A Hoare-Like Calculus Using the SROIQ σ Logic on Transformations of Graphs
  16. Altmetric Badge
    Chapter 15 Termination Analysis for Graph Transformation Systems
  17. Altmetric Badge
    Chapter 16 Tropical Two-Way Automata
  18. Altmetric Badge
    Chapter 17 Theoretical Computer Science
  19. Altmetric Badge
    Chapter 18 Specifying and Verifying Properties of Space
  20. Altmetric Badge
    Chapter 19 Theoretical Computer Science
  21. Altmetric Badge
    Chapter 20 Theoretical Computer Science
  22. Altmetric Badge
    Chapter 21 Towards a Coalgebraic Chomsky Hierarchy
  23. Altmetric Badge
    Chapter 22 Theoretical Computer Science
  24. Altmetric Badge
    Chapter 23 Theoretical Computer Science
  25. Altmetric Badge
    Chapter 24 Theoretical Computer Science
  26. Altmetric Badge
    Chapter 25 Theoretical Computer Science
  27. Altmetric Badge
    Chapter 26 The Inhabitation Problem for Non-idempotent Intersection Types
Attention for Chapter 11: Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds’ Algorithm
Altmetric Badge

About this Attention Score

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

Mentioned by

twitter
4 X users

Citations

dimensions_citation
6 Dimensions

Readers on

mendeley
3 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
Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds’ Algorithm
Chapter number 11
Book title
Theoretical Computer Science
Published in
Lecture notes in computer science, September 2014
DOI 10.1007/978-3-662-44602-7_11
Book ISBNs
978-3-66-244601-0, 978-3-66-244602-7
Authors

Jiří Wiedermann, Wiedermann, Jiří

X Demographics

X Demographics

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

Geographical breakdown

Country Count As %
Italy 1 33%
Unknown 2 67%

Demographic breakdown

Readers by professional status Count As %
Professor 1 33%
Student > Ph. D. Student 1 33%
Student > Master 1 33%
Readers by discipline Count As %
Computer Science 2 67%
Unknown 1 33%
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 01 February 2015.
All research outputs
#12,910,813
of 22,780,165 outputs
Outputs from Lecture notes in computer science
#3,773
of 8,124 outputs
Outputs of similar age
#106,343
of 237,237 outputs
Outputs of similar age from Lecture notes in computer science
#104
of 226 outputs
Altmetric has tracked 22,780,165 research outputs across all sources so far. This one is in the 42nd percentile – i.e., 42% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,124 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 52% 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 237,237 tracked outputs that were published within six weeks on either side of this one in any source. This one has gotten more attention than average, scoring higher than 54% of its contemporaries.
We're also able to compare this research output to 226 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.