Pages that link to "Item:Q3142589"

The following pages link to Random-Self-Reducibility of Complete Sets (Q3142589):

Displaying 30 items.

• Unprovable security of perfect NIZK and non-interactive non-malleable commitments (Q332270) (← links)
• Average-case intractability vs. worst-case intractability (Q598182) (← links)
• Arithmetization: A new method in structural complexity theory (Q685721) (← links)
• Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification (Q744610) (← links)
• On the autoreducibility of functions (Q970103) (← links)
• The power of adaptiveness and additional queries in random-self- reductions (Q1332664) (← links)
• On algorithmic applications of the immersion order: An overview of ongoing work presented at the Third Slovenian International Conference on Graph Theory (Q1379838) (← links)
• Proofs of Work from worst-case assumptions (Q1673424) (← links)
• Computational barriers to estimation from low-degree polynomials (Q2149001) (← links)
• On building fine-grained one-way functions from strong average-case hardness (Q2170063) (← links)
• Can we locally compute sparse connected subgraphs? (Q2399362) (← links)
• Algebraic generalization of Diffie-Hellman key exchange (Q2413287) (← links)
• Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification (Q3088109) (← links)
• Towards Non-Black-Box Separations of Public Key Encryption and One Way Function (Q3181026) (← links)
• On Nonadaptive Reductions to the Set of Random Strings and Its Dense Subsets (Q3297825) (← links)
• A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem (Q4634034) (← links)
• (Q5002697) (← links)
• An information-theoretic treatment of random-self-reducibility (Q5048951) (← links)
• (Q5092470) (← links)
• Worst-Case to Average-Case Reductions for Subclasses of P (Q5098780) (← links)
• (Q5121895) (← links)
• The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs (Q5157395) (← links)
• Exponential lower bound for 2-query locally decodable codes via a quantum argument (Q5917576) (← links)
• Pseudorandom generators without the XOR lemma (Q5943089) (← links)
• Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions (Q5958646) (← links)
• (Q6084353) (← links)
• (Q6084358) (← links)
• Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle? (Q6113106) (← links)
• The power of natural properties as oracles (Q6116834) (← links)
• Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\) (Q6140986) (← links)