Closure and nonclosure properties of the classes of compressible and rankable sets
From MaRDI portal
Publication:2037201
Recommendations
Cites work
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 719756 (Why is no real title available?)
- scientific article; zbMATH DE number 1482586 (Why is no real title available?)
- scientific article; zbMATH DE number 3273186 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- A generic approach for the unranking of labeled combinatorial classes
- A very hard log-space counting class
- Avoiding simplicity is complex
- Boolean operations, joins, and the extended low hierarchy
- Closure and nonclosure properties of the compressible and rankable sets
- Closure properties and descriptional complexity of deterministic regular expressions
- Closure properties of pattern languages
- Closure properties of synchronized relations
- Complexity Measures for Public-Key Cryptosystems
- Complexity and structure
- Compression and Ranking
- Copyless cost-register automata: structure, expressiveness, and closure properties
- Easy sets and hard certificate schemes
- Further closure properties of input-driven pushdown automata
- Inverting onto functions.
- Lexicographic ranking and unranking of derangements in cycle notation
- Nondeterministic Space is Closed under Complementation
- On decidability and closure properties of language classes with respect to bio-operations
- On the complexity of ranking
- P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP
- P-selectivity: Intersections and indices
- Polynomial-time compression
- Ranking and unranking fixed-density necklaces and Lyndon words
- Ranking and unranking permutations in linear time
- Ranking/unranking of lambda terms with compressed de Bruijn indices
- Recursion-theoretic ranking and compression
- Resource-bounded Kolmogorov complexity revisited
- Retraceable Sets
- Scalability and the isomorphism problem
- Sparse Sets, Lowness and Highness
- Tally NP sets and easy census functions.
- The complexity of computing the number of strings of given length in context-free languages
- The complexity of ranking simple languages
- The method of forced enumeration for nondeterministic automata
- Theory of semi-feasible algorithms
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)
