Closure and nonclosure properties of the classes of compressible and rankable sets
From MaRDI portal
Publication:2037201
DOI10.1016/J.JCSS.2021.02.004OpenAlexW3136383125MaRDI QIDQ2037201FDOQ2037201
Authors: Jackson Abascal, Shir Maimon, Daniel Rubery, Lane A. Hemaspaandra 
Publication date: 30 June 2021
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2021.02.004
Recommendations
Cites Work
- Closure properties and descriptional complexity of deterministic regular expressions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nondeterministic Space is Closed under Complementation
- Title not available (Why is that?)
- P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP
- P-selectivity: Intersections and indices
- Complexity Measures for Public-Key Cryptosystems
- The method of forced enumeration for nondeterministic automata
- Closure properties of pattern languages
- The complexity of computing the number of strings of given length in context-free languages
- A very hard log-space counting class
- A generic approach for the unranking of labeled combinatorial classes
- Complexity and structure
- Resource-bounded Kolmogorov complexity revisited
- Theory of semi-feasible algorithms
- Ranking and unranking permutations in linear time
- Lexicographic ranking and unranking of derangements in cycle notation
- Boolean operations, joins, and the extended low hierarchy
- Retraceable Sets
- Inverting onto functions.
- Sparse Sets, Lowness and Highness
- Polynomial-time compression
- Avoiding simplicity is complex
- Compression and Ranking
- Easy sets and hard certificate schemes
- On the complexity of ranking
- The complexity of ranking simple languages
- Title not available (Why is that?)
- Scalability and the isomorphism problem
- Tally NP sets and easy census functions.
- Ranking/unranking of lambda terms with compressed de Bruijn indices
- Recursion-theoretic ranking and compression
- Title not available (Why is that?)
- Copyless cost-register automata: structure, expressiveness, and closure properties
- Ranking and unranking fixed-density necklaces and Lyndon words
- Closure and nonclosure properties of the compressible and rankable sets
- On decidability and closure properties of language classes with respect to bio-operations
- Closure properties of synchronized relations
- Further closure properties of input-driven pushdown automata
Cited In (3)
This page was built for publication: Closure and nonclosure properties of the classes of compressible and rankable sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2037201)
