The following pages link to Yongge Wang (Q181992):
Displaying 38 items.
- On encoding symbol degrees of array BP-XOR codes (Q267791) (← links)
- NP-hard sets are superterse unless NP is small (Q290182) (← links)
- A separation of two randomness concepts (Q294630) (← links)
- Security analysis of a password-based authentication protocol proposed to IEEE 1363 (Q818140) (← links)
- Construction of compactly supported orthonormal wavelets with beautiful structure (Q866087) (← links)
- The algebraic structure of the isomorphic types of tally, polynomial time computable sets (Q1407537) (← links)
- Resource bounded randomness and computational complexity (Q1566703) (← links)
- A comparison of two approaches to pseudorandomness (Q1605323) (← links)
- (Q1818088) (redirect page) (← links)
- Randomness, stochasticity, and approximations (Q1818089) (← links)
- Edge-colored graphs with applications to homogeneous faults (Q1944099) (← links)
- UC-PSkyline: probabilistic skyline queries over uncertain contexts (Q1990343) (← links)
- Privacy preserving computation in cloud using noise-free fully homomorphic encryption (FHE) schemes (Q2165473) (← links)
- Reusable garbled Turing machines without FHE (Q2327199) (← links)
- A characterization of \(L^p(\mathbb R )\) by local trigonometric bases with \(1<p<\infty\) (Q2498395) (← links)
- (Q2720330) (← links)
- Homogeneous Faults, Colored Edge Graphs, and Cover Free Families (Q3002102) (← links)
- Quantum Resistant Public Key Encryption Scheme polarRLCE (Q3294872) (← links)
- Separations by random oracles and “Almost” classes for generalized reducibilities (Q3569010) (← links)
- (Q3592878) (← links)
- Perfectly Secure Message Transmission Revisited (Q3604420) (← links)
- Genericity, Randomness, and Polynomial-Time Approximations (Q4210154) (← links)
- (Q4250780) (← links)
- (Q4381402) (← links)
- (Q4414289) (← links)
- (Q4500377) (← links)
- (Q4502504) (← links)
- (Q4502507) (← links)
- (Q4520525) (← links)
- Resource-bounded balanced genericity, stochasticity and weak randomness (Q4593918) (← links)
- (Q4737267) (← links)
- (Q4808644) (← links)
- (Q5284998) (← links)
- ANALYZING VULNERABILITIES OF CRITICAL INFRASTRUCTURES USING FLOWS AND CRITICAL VERTICES IN AND/OR GRAPHS (Q5696968) (← links)
- Computing and Combinatorics (Q5716933) (← links)
- Algorithms and Computation (Q5897861) (← links)
- Secure communication in multicast channels: The answer to Franklin and Wright's question (Q5934143) (← links)
- Recursively enumerable reals and Chaitin \(\Omega\) numbers (Q5941066) (← links)
