On sparseness, reducibilities, and complexity

Annals of Pure and Applied Logic 134 (1):53-61 (2005)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,659

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Nondeterministic bounded query reducibilities.Richard Beigel, William Gasarch & Jim Owings - 1989 - Annals of Pure and Applied Logic 41 (2):107-118.
Beyond Borel-amenability: Scales and superamenable reducibilities.L. Ros - 2010 - Annals of Pure and Applied Logic 161 (7):829-836.
Beyond Borel-amenability: scales and superamenable reducibilities.Luca Motto Ros - 2010 - Annals of Pure and Applied Logic 161 (7):829-836.
Complexity in Young's lattice.Alexander Wires - 2022 - Annals of Pure and Applied Logic 173 (4):103075.
On the complexity of the Leibniz hierarchy.Tommaso Moraschini - 2019 - Annals of Pure and Applied Logic 170 (7):805-824.
Lower complexity bounds in justification logic.Samuel R. Buss & Roman Kuznets - 2012 - Annals of Pure and Applied Logic 163 (7):888-905.
The computational complexity of module socles.Huishan Wu - 2022 - Annals of Pure and Applied Logic 173 (5):103089.
Descriptive complexity of graph spectra.Anuj Dawar, Simone Severini & Octavio Zapata - 2019 - Annals of Pure and Applied Logic 170 (9):993-1007.
Proof complexity of substructural logics.Raheleh Jalali - 2021 - Annals of Pure and Applied Logic 172 (7):102972.

Analytics

Added to PP
2014-01-16

Downloads
8 (#1,360,066)

6 months
6 (#740,247)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references