2007 | Eta pairing computation on general divisors over hyperelliptic curves y2 = x7 - X ± 1 | 이향숙 | Conference Paper |
2008 | Eta pairing computation on general divisors over hyperelliptic curves y2 = xp - x + d | 이향숙; 이윤진 | Article |
2007 | Every operator almost commutes with a compact operator | 고응일 | Article |
2023 | Exact SDP relaxations for quadratic programs with bipartite graph structures | 김선영 | Article |
2022 | Exact SDP relaxations of quadratically constrained quadratic programs with forest structures | 김선영 | Article |
2017 | Exact semidefinite programming relaxations with truncated moment matrix for binary polynomial optimization problems | 김선영 | Article |
2003 | Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxations | 김선영 | Article |
2006 | Exotic smooth structure on CP2#13(CP)over-bar(2) | 조용승 | Article |
2024 | Expansivity and Contractivity of Toeplitz Operators on Newton Spaces | 고응일 | Article |
2016 | Explicit Criteria for Construction of Plateaued Functions | 이윤진; 이정연 | Article |
2016 | Explicit criterions for p-ary functions being non-bent | 이윤진; 현종윤 | Article |
2013 | Explicit expression of the krawtchouk polynomial via a discrete green's function | 이윤진 | Article |
2015 | Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves | 이향숙; 이은정 | Article |
2013 | Explicit isogeny theorems for drinfeld modules | 이윤진 | Article |
2019 | EXPLICIT SURJECTIVITY RESULTS FOR DRINFELD MODULES OF RANK 2 | 이윤진 | Article |
2011 | Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion | 김선영 | Article |
2009 | Exploiting sparsity in SDP relaxation for sensor network localization | 김선영 | Article |
2012 | Exploiting sparsity in SDP relaxation of polynomial optimization problems | 김선영 | Book Chapter |
2013 | Exponential polynomial reproducing property of non-stationary symmetric subdivision schemes and normalized exponential B-splines | 윤정호 | Article |
2016 | Extension of Completely Positive Cone Relaxation to Moment Cone Relaxation for Polynomial Optimization | 김선영 | Article |