↓ Skip to main content
What is this page? Embed badge

Mathematical Foundations of Computer Science 2014

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 On r -Simple k -Path
  3. Altmetric Badge
    Chapter 2 Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs
  4. Altmetric Badge
    Chapter 3 Zero Knowledge and Circuit Minimization
  5. Altmetric Badge
    Chapter 4 A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity
  6. Altmetric Badge
    Chapter 5 $\widetilde{O}(\sqrt{n})$ -Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability
  7. Altmetric Badge
    Chapter 6 Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set
  8. Altmetric Badge
    Chapter 7 Network-Based Dissolution
  9. Altmetric Badge
    Chapter 8 On Unification of QBF Resolution-Based Calculi
  10. Altmetric Badge
    Chapter 9 Minimum Planar Multi-sink Cuts with Connectivity Priors
  11. Altmetric Badge
    Chapter 10 The Price of Envy-Freeness in Machine Scheduling
  12. Altmetric Badge
    Chapter 11 On the Complexity of Some Ordering Problems
  13. Altmetric Badge
    Chapter 12 The Relationship between Multiplicative Complexity and Nonlinearity
  14. Altmetric Badge
    Chapter 13 Dual Connectedness of Edge-Bicolored Graphs and Beyond
  15. Altmetric Badge
    Chapter 14 Combinatorial Voter Control in Elections
  16. Altmetric Badge
    Chapter 15 An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas
  17. Altmetric Badge
    Chapter 16 On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields
  18. Altmetric Badge
    Chapter 17 Hitting Forbidden Subgraphs in Graphs of Bounded Treewidth
  19. Altmetric Badge
    Chapter 18 Probabilistic Analysis of Power Assignments
  20. Altmetric Badge
    Chapter 19 Existence of Secure Equilibrium in Multi-player Games with Perfect Information
  21. Altmetric Badge
    Chapter 20 An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear Group
  22. Altmetric Badge
    Chapter 21 A Note on the Minimum Distance of Quantum LDPC Codes
  23. Altmetric Badge
    Chapter 22 Minimum Bisection Is NP-hard on Unit Disk Graphs
  24. Altmetric Badge
    Chapter 23 Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty
  25. Altmetric Badge
    Chapter 24 Streaming Kernelization
  26. Altmetric Badge
    Chapter 25 A Reconfigurations Analogue of Brooks’ Theorem
  27. Altmetric Badge
    Chapter 26 Intersection Graphs of L-Shapes and Segments in the Plane
  28. Altmetric Badge
    Chapter 27 Autoreducibility and Mitoticity of Logspace-Complete Sets for NP and Other Classes
  29. Altmetric Badge
    Chapter 28 Editing to a Connected Graph of Given Degrees
  30. Altmetric Badge
    Chapter 29 Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth
  31. Altmetric Badge
    Chapter 30 On Characterizations of Randomized Computation Using Plain Kolmogorov Complexity
  32. Altmetric Badge
    Chapter 31 New Results for Non-Preemptive Speed Scaling
  33. Altmetric Badge
    Chapter 32 Lower Bounds for Splittings by Linear Combinations
  34. Altmetric Badge
    Chapter 33 On the Complexity of List Ranking in the Parallel External Memory Model
  35. Altmetric Badge
    Chapter 34 Knocking Out P k -free Graphs
  36. Altmetric Badge
    Chapter 35 Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis
  37. Altmetric Badge
    Chapter 36 Affine Consistency and the Complexity of Semilinear Constraints
  38. Altmetric Badge
    Chapter 37 Small Complexity Classes for Computable Analysis
  39. Altmetric Badge
    Chapter 38 Two Results about Quantum Messages
  40. Altmetric Badge
    Chapter 39 Parameterized Approximations via d - Skew-Symmetric Multicut
  41. Altmetric Badge
    Chapter 40 On the Clique Editing Problem
  42. Altmetric Badge
    Chapter 41 On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic
  43. Altmetric Badge
    Chapter 42 Computational Complexity of Covering Three-Vertex Multigraphs
  44. Altmetric Badge
    Chapter 43 Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs
  45. Altmetric Badge
    Chapter 44 On Coloring Resilient Graphs
  46. Altmetric Badge
    Chapter 45 Document Retrieval with One Wildcard
  47. Altmetric Badge
    Chapter 46 An H n /2 Upper Bound on the Price of Stability of Undirected Network Design Games
  48. Altmetric Badge
    Chapter 47 Traveling Salesman Problems in Temporal Graphs
  49. Altmetric Badge
    Chapter 48 Inferring Strings from Lyndon Factorization
  50. Altmetric Badge
    Chapter 49 Betweenness Centrality – Incremental and Faster
  51. Altmetric Badge
    Chapter 50 Deterministic Parameterized Algorithms for the Graph Motif Problem
  52. Altmetric Badge
    Chapter 51 The Two Queries Assumption and Arthur-Merlin Classes
  53. Altmetric Badge
    Chapter 52 Flexible Bandwidth Assignment with Application to Optical Networks
  54. Altmetric Badge
    Chapter 53 Approximation Algorithms for Bounded Color Matchings via Convex Decompositions
Attention for Chapter 2: Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs
Altmetric Badge

Mentioned by

q&a
1 Q&A thread

Readers on

mendeley
6 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
Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs
Chapter number 2
Book title
Mathematical Foundations of Computer Science 2014
Published by
Springer Berlin Heidelberg, August 2014
DOI 10.1007/978-3-662-44465-8_2
Book ISBNs
978-3-66-244464-1, 978-3-66-244465-8
Authors

Eric Allender, Nikhil Balaji, Samir Datta, Allender, Eric, Balaji, Nikhil, Datta, Samir

View on publisher site

Login to access the Attention Digest and the Sentiment Analysis related to this output.

Timeline Attention over time Attention Score history
Login to access the full charts related to this output.
Activity
Login to access the full charts related to this output.
Mendeley demographics

Mendeley demographics

The data shown below were compiled from readership statistics for 6 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Login to view Mendeley reader trends over time.

Geographical breakdown

Country Count As %
Unknown 6 100%

Demographic breakdown

Readers by professional status Count As %
Researcher 2 33%
Student > Master 2 33%
Professor > Associate Professor 1 17%
Unknown 1 17%
Readers by discipline Count As %
Computer Science 3 50%
Mathematics 1 17%
Unknown 2 33%