The following pages link to P-Printable Sets (Q4732106):
Displaying 36 items.
- Tight lower bounds on the ambiguity of strong, total, associative, one-way functions (Q596322) (← links)
- If not empty, NP-P is topologically large (Q688157) (← links)
- Lower bounds and the hardness of counting properties (Q703531) (← links)
- Kolmogorov characterizations of complexity classes (Q804291) (← links)
- Kolmogorov complexity and degrees of tally sets (Q916650) (← links)
- On the complexity of ranking (Q920620) (← links)
- Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions (Q935140) (← links)
- On sets polynomially enumerable by iteration (Q1176233) (← links)
- On polynomial-time Turing and many-one completeness in PSPACE (Q1193869) (← links)
- Polynomial-time compression (Q1198955) (← links)
- Circuit size relative to pseudorandom oracles (Q1208410) (← links)
- Quasi-injective reductions (Q1314394) (← links)
- The complexity of computing maximal word functions (Q1321032) (← links)
- A taxonomy of complexity classes of functions (Q1329166) (← links)
- Scalability and the isomorphism problem (Q1351582) (← links)
- Measure on \(P\): Strength of the notion (Q1362904) (← links)
- Complete distributional problems, hard languages, and resource-bounded measure (Q1575682) (← links)
- A second step towards complexity-theoretic analogs of Rice's Theorem (Q1575716) (← links)
- On characterizing the existence of partial one-way permutations (Q1603545) (← links)
- Some consequences of the existnce of pseudorandom generators (Q1822961) (← links)
- Tally NP sets and easy census functions. (Q1854340) (← links)
- Sparse sets and collapse of complexity classes (Q1854459) (← links)
- Isolation, matching, and counting uniform and nonuniform upper bounds (Q1961370) (← links)
- Nondeterminisic sublinear time has measure 0 in P (Q1999993) (← links)
- NL-printable sets and nondeterministic Kolmogorov complexity (Q2369009) (← links)
- Quantum and classical complexity classes: Separations, collapses, and closure properties (Q2486397) (← links)
- Dimension, entropy rates, and compression (Q2495412) (← links)
- If P \(\neq\) NP then some strongly noninvertible functions are invertible (Q2508963) (← links)
- Reducibilities on tally and sparse sets (Q3357534) (← links)
- Limitations of the upward separation technique (Q3490941) (← links)
- Restrictive Acceptance Suffices for Equivalence Problems (Q4504964) (← links)
- Fault-tolerance and complexity (Extended abstract) (Q4630260) (← links)
- NL-printable sets and Nondeterministic Kolmogorov Complexity (Q4924524) (← links)
- Degrees and reducibilities of easy tally sets (Q5096899) (← links)
- On the power of parity polynomial time (Q5750401) (← links)
- On the power of counting the total number of computation paths of NPTMs (Q6636085) (← links)
