The following pages link to Chun-Ming Tang (Q439449):
Displaying 50 items.
- (Q350930) (redirect page) (← links)
- Secure multi-party computation protocol for sequencing problem (Q350932) (← links)
- An ID-based authenticated dynamic group key agreement with optimal round (Q362177) (← links)
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization (Q393748) (← links)
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions (Q439450) (← links)
- Leakproof secret sharing protocols with applications to group identification scheme (Q439799) (← links)
- Several cryptographic applications of \(\Sigma\)-protocol (Q473026) (← links)
- The complexity and randomness of linear multi-secret sharing schemes with non-threshold structures (Q477568) (← links)
- Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems (Q481052) (← links)
- A class of linear codes with a few weights (Q502407) (← links)
- A class of hyper-bent functions and Kloosterman sums (Q520081) (← links)
- Linear codes with few weights from inhomogeneous quadratic functions (Q521872) (← links)
- Special values of Kloosterman sums and binomial bent functions (Q530400) (← links)
- Two new predictor-corrector algorithms for second-order cone programming (Q536560) (← links)
- Inverse problems and solution methods for a class of nonlinear complementarity problems (Q540647) (← links)
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity (Q556270) (← links)
- A working set SQCQP algorithm with simple nonmonotone penalty parameters (Q654747) (← links)
- A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization (Q669396) (← links)
- Two classes of optimal frequency-hopping sequences with new parameters (Q669616) (← links)
- A note on cyclic codes from APN functions (Q744011) (← links)
- An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems (Q824547) (← links)
- Infinite families of 3-designs from o-polynomials (Q825921) (← links)
- Error bound results for generalized D-gap functions of nonsmooth variational inequality problems (Q848535) (← links)
- A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization (Q858741) (← links)
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization (Q875393) (← links)
- Implementing optimized pairings with elliptic nets (Q893619) (← links)
- A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function (Q939555) (← links)
- A new norm-relaxed SQP algorithm with global convergence (Q972949) (← links)
- On a separation principle for nonconvex sets (Q1005836) (← links)
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions (Q1044081) (← links)
- Explicit characterization of two classes of regular bent functions (Q1633169) (← links)
- Two infinite classes of rotation symmetric bent functions with simple representation (Q1647742) (← links)
- Two classes of linear codes and their weight distributions (Q1647743) (← links)
- Optimal FHSs and DSSs via near zero-difference balanced functions (Q1671375) (← links)
- Privacy-preserving outsourcing of image feature extraction in cloud computing (Q1701922) (← links)
- A new family of optimal FHS sets with composite lengths (Q1732779) (← links)
- A method to enlarge the design distance of BCH codes and some classes of infinite optimal cyclic codes (Q1745072) (← links)
- A feasible point method with bundle modification for nonsmooth convex constrained optimization (Q1753350) (← links)
- Several infinite families of \(p\)-ary weakly regular bent functions (Q1783727) (← links)
- Euclidean and Hermitian LCD MDS codes (Q1791672) (← links)
- Faster pairing computation on genus \(2\) hyperelliptic curves (Q1944931) (← links)
- Finding the maximal adversary structure from any given access structure (Q1999100) (← links)
- On the boomerang uniformity of quadratic permutations (Q2004976) (← links)
- A construction of \(p\)-ary linear codes with two or three weights (Q2025343) (← links)
- A new class of \(p\)-ary regular bent functions (Q2025347) (← links)
- The projective general linear group \(\mathrm{PGL}(2,2^m)\) and linear codes of length \(2^m+1\) (Q2035462) (← links)
- Combinatorial \(t\)-designs from special functions (Q2040310) (← links)
- Least-squares-based three-term conjugate gradient methods (Q2069298) (← links)
- Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros (Q2070264) (← links)
- A new restricted memory level bundle method for constrained convex nonsmooth optimization (Q2080833) (← links)
