Pages that link to "Item:Q3722415"
From MaRDI portal
The following pages link to The complexity of promise problems with applications to public-key cryptography (Q3722415):
Displayed 28 items.
- NP is as easy as detecting unique solutions (Q1090454) (← links)
- Promise problems complete for complexity classes (Q1109568) (← links)
- Unambiguous computations and locally definable acceptance types (Q1127545) (← links)
- Practic zero-knowledge proofs: Giving hints and using deficiencies (Q1180509) (← links)
- Separating complexity classes with tally oracles (Q1185002) (← links)
- Graph isomorphism is low for PP (Q1210331) (← links)
- A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm (Q1261018) (← links)
- Hard promise problems and nonuniform complexity (Q1261468) (← links)
- A relation of primal--dual lattices and the complexity of shortest lattice vector problem (Q1274988) (← links)
- A hierarchy based on output multiplicity (Q1274991) (← links)
- A taxonomy of complexity classes of functions (Q1329166) (← 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 the reducibility of sets inside NP to sets with low information content (Q1765294) (← links)
- A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor (Q1861566) (← links)
- Mathematical problems in cryptology (Q1910812) (← links)
- On membership comparable sets (Q1961377) (← links)
- Reductions between disjoint NP-pairs (Q2387199) (← links)
- Graph Isomorphism is in SPP (Q2495656) (← links)
- A common algebraic description for probabilistic and quantum computations (Q2575744) (← links)
- On polynomial-time truth-table reducibility of intractable sets to P-selective sets (Q3210177) (← links)
- Absolute results concerning one-way functions and their applications (Q3833992) (← links)
- On sets bounded truth-table reducible to $P$-selective sets (Q4717049) (← links)
- Monotonous and randomized reductions to sparse sets (Q4717050) (← links)
- How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge (Q5445500) (← links)
- General Properties of Quantum Zero-Knowledge Proofs (Q5445501) (← links)
- An Equivalence Between Zero Knowledge and Commitments (Q5445522) (← links)
- Assisted Problem Solving and Decompositions of Finite Automata (Q5448655) (← links)