Pages that link to "Item:Q4128010"
From MaRDI portal
The following pages link to On Isomorphisms and Density of $NP$ and Other Complete Sets (Q4128010):
Displaying 50 items.
- Relativizing relativized computations (Q1822968) (← links)
- On inefficient special cases of NP-complete problems (Q1823688) (← links)
- Distinguishing conjunctive and disjunctive reducibilities by sparse sets (Q1823690) (← links)
- Tally NP sets and easy census functions. (Q1854340) (← links)
- Uniformly hard languages. (Q1874273) (← links)
- One-way permutations and self-witnessing languages (Q1877694) (← links)
- Non-uniform reductions (Q1959376) (← links)
- Computational complexity of synchronization under sparse regular constraints (Q2140506) (← links)
- Nonuniform reductions and NP-completeness (Q2158296) (← links)
- A new algorithm design technique for hard problems (Q2173301) (← links)
- The complexity of counting edge colorings for simple graphs (Q2232603) (← links)
- A note on bi-immunity and \(p\)-closeness of \(p\)-cheatable sets in \(P\)/poly (Q2366689) (← links)
- Collapsing degrees via strong computation (Q2366690) (← links)
- Query-monotonic Turing reductions (Q2383592) (← links)
- Polynomial time quantum computation with advice (Q2390250) (← links)
- All superlinear inverse schemes are coNP-hard (Q2575753) (← links)
- Resource bounded immunity and simplicity (Q2576870) (← links)
- What can be efficiently reduced to the Kolmogorov-random strings? (Q2576937) (← links)
- Separating the low and high hierarchies by oracles (Q2638773) (← links)
- One-way functions and the nonisomorphism of NP-complete sets (Q2639055) (← links)
- On uniformity within \(NC^ 1\) (Q2640342) (← links)
- On the equivalence of two post-quantum cryptographic families (Q2687966) (← links)
- Investigations Concerning the Structure of Complete Sets (Q2821693) (← links)
- ON UNIVERSALLY POLYNOMIAL CONTEXT-FREE LANGUAGES (Q3021989) (← links)
- On polynomial-time truth-table reducibility of intractable sets to P-selective sets (Q3210177) (← links)
- Nonuniform reductions and NP-completeness (Q3304139) (← links)
- The Fault Tolerance of NP-Hard Problems (Q3618596) (← links)
- Bi-immune sets for complexity classes (Q3690222) (← links)
- Nonlevelable sets and immune sets in the accepting density hierarchy inNP (Q3711750) (← links)
- Classifying the computational complexity of problems (Q3781088) (← links)
- OnP-subset structures (Q3789542) (← links)
- Linear time transformations between combinatorial problems (Q3936214) (← links)
- Completeness for nondeterministic complexity classes (Q3979608) (← links)
- A survey of one-way functions in complexity theory (Q4009812) (← links)
- On the complexity of graph reconstruction (Q4298372) (← links)
- Productive functions and isomorphisms (Q4327382) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances (Q4457892) (← links)
- On the computational complexity of the Jones and Tutte polynomials (Q4712248) (← links)
- Monotonous and randomized reductions to sparse sets (Q4717050) (← links)
- Complete sets and closeness to complexity classes (Q4727430) (← links)
- On sparseness and Turing reducibility over the reals (Q4916198) (← links)
- Structural complexity theory: Recent surprises (Q5056087) (← links)
- Complete problems and strong polynomial reducibilities (Q5096158) (← links)
- The degree structure of 1-L reductions (Q5096826) (← links)
- Almost every set in exponential time is P-bi-immune (Q5096852) (← links)
- Characterizing regular languages with polynomial densities (Q5096862) (← links)
- Reductions to sets of low information content (Q5204315) (← links)
- Separating NE from Some Nonuniform Nondeterministic Complexity Classes (Q5323096) (← links)
- Non-mitotic Sets (Q5458830) (← links)
- Strong Reductions and Isomorphism of Complete Sets (Q5458832) (← links)
