Pages that link to "Item:Q3787917"
From MaRDI portal
The following pages link to Complexity Measures for Public-Key Cryptosystems (Q3787917):
Displayed 50 items.
- An observation on associative one-way functions in complexity theory (Q293135) (← links)
- A classification of the probabilistic polynomial time hierarchy under fault tolerant access to oracle classes (Q294649) (← links)
- A thirty year old conjecture about promise problems (Q347124) (← links)
- Computational indistinguishability between quantum states and its cryptographic application (Q434349) (← links)
- Tight lower bounds on the ambiguity of strong, total, associative, one-way functions (Q596322) (← links)
- The shrinking property for NP and coNP (Q627189) (← links)
- Inseparability and strong hypotheses for disjoint NP pairs (Q693061) (← links)
- A note on quadratic residuosity and UP (Q834917) (← links)
- Nondeterministic functions and the existence of optimal proof systems (Q837177) (← links)
- Canonical disjoint NP-pairs of propositional proof systems (Q868942) (← links)
- Statistical zero knowledge and quantum one-way functions (Q884454) (← links)
- Classes of representable disjoint \textsf{NP}-pairs (Q884465) (← links)
- Robust machines accept easy sets (Q914369) (← links)
- Tuples of disjoint \(\mathsf{NP}\)-sets (Q929286) (← links)
- Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions (Q935140) (← links)
- The complexity of unions of disjoint sets (Q955349) (← links)
- One-way permutations, computational asymmetry and distortion. (Q959774) (← links)
- The deduction theorem for strong propositional proof systems (Q987382) (← links)
- Unambiguous computations and locally definable acceptance types (Q1127545) (← links)
- On sets polynomially enumerable by iteration (Q1176233) (← links)
- Oracles for structural properties: The isomorphism problem and public-key cryptography (Q1190988) (← links)
- On polynomial time one-truth-table reducibility to a sparse set (Q1191028) (← links)
- On polynomial-time Turing and many-one completeness in PSPACE (Q1193869) (← links)
- Polynomial-time compression (Q1198955) (← links)
- Diagonalization, uniformity, and fixed-point theorems (Q1201287) (← links)
- Hard promise problems and nonuniform complexity (Q1261468) (← links)
- A hierarchy based on output multiplicity (Q1274991) (← links)
- Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory (Q1307703) (← links)
- Quasi-injective reductions (Q1314394) (← links)
- On reductions of NP sets to sparse sets (Q1329162) (← links)
- A taxonomy of complexity classes of functions (Q1329166) (← links)
- A general method to construct oracles realizing given relationships between complexity classes (Q1351504) (← links)
- The isomorphism conjecture holds and one-way functions exist relative to an oracle (Q1362333) (← links)
- How to define a linear order on finite models (Q1371431) (← links)
- An oracle builder's toolkit (Q1398366) (← links)
- On reducibility and symmetry of disjoint NP pairs. (Q1401249) (← links)
- Inverting onto functions. (Q1426007) (← links)
- A second step towards complexity-theoretic analogs of Rice's Theorem (Q1575716) (← links)
- Characterizing the existence of one-way permutations (Q1575721) (← links)
- On the limits of nonapproximability of lattice problems (Q1577010) (← links)
- A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. (Q1589481) (← links)
- On characterizing the existence of partial one-way permutations (Q1603545) (← links)
- A note on unambiguous function classes (Q1607022) (← links)
- Enumerative counting is hard (Q1822963) (← links)
- One-way permutations and self-witnessing languages (Q1877694) (← links)
- Proof system representations of degrees of disjoint NP-pairs (Q1944897) (← links)
- Complexity limitations on quantum computation (Q1961375) (← links)
- The robustness of LWPP and WPP, with an application to graph reconstruction (Q2027204) (← links)
- Closure and nonclosure properties of the classes of compressible and rankable sets (Q2037201) (← links)
- The complexity of online bribery in sequential elections (Q2121471) (← links)