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

Classical and New Paradigms of Computation and their Complexity Hierarchies

Overview of attention for book
Cover of 'Classical and New Paradigms of Computation and their Complexity Hierarchies'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Complexity hierarchies derived from reduction functions
  3. Altmetric Badge
    Chapter 2 Quantum query algorithms and lower bounds
  4. Altmetric Badge
    Chapter 3 Algebras of minimal rank: overview and recent developments
  5. Altmetric Badge
    Chapter 4 Recent developments in iterated forcing theory
  6. Altmetric Badge
    Chapter 5 Classification problems in algebra and topology
  7. Altmetric Badge
    Chapter 6 Using easy optimization problems to solve hard ones
  8. Altmetric Badge
    Chapter 7 On Sacks forcing and the Sacks property
  9. Altmetric Badge
    Chapter 8 Supertask computation
  10. Altmetric Badge
    Chapter 9 A refinement of Jensen's constructible hierarchy
  11. Altmetric Badge
    Chapter 10 Effective Hausdorff dimension
  12. Altmetric Badge
    Chapter 11 Axiomatizability of algebras of binary relations
  13. Altmetric Badge
    Chapter 12 Forcing axioms and projective sets of reals
  14. Altmetric Badge
    Chapter 13 Post's and other problems of supertasks of higher type
Attention for Chapter 11: Axiomatizability of algebras of binary relations
Altmetric Badge

Citations

dimensions_citation
3 Dimensions

Readers on

mendeley
1 Mendeley
Summary Dimensions citations
So far, Dimensions has found 3 publications that cite this research output.

3

The most recent citing publications are shown below. View all 3 publications that cite this research output on Dimensions.

This page shows the most recent citations of this research output.

Click here to find out how to access more activity.

This page is provided by Altmetric.