Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Discrete logarithm problem on elliptic curves
Download
093442.pdf
Date
2000
Author
Saldamlı, Gökay
Metadata
Show full item record
Item Usage Stats
98
views
0
downloads
Cite This
URI
https://hdl.handle.net/11511/7610
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
Discrete symmetries and nonlocal reductions
GÜRSES, METİN; Pekcan, Asli; Zheltukhın, Kostyantyn (Elsevier BV, 2020-01-31)
We show that nonlocal reductions of systems of integrable nonlinear partial differential equations are the special discrete symmetry transformations.
Discrete bifurcation diagrams and persistence
Örnek, Türkmen; Pamuk, Semra; Department of Mathematics (2018)
Let fti : M → R be a discrete Morse function on a cell complex M for each t0 < t1 < ... < tn = 1. Let us denote slice as Mi = M ×{ti} ⊂ M × I and let Vi be the discrete vector field on each slice. After extending the discrete vector field on each slice to a discrete vector field on all of M ×I, a discrete bifurcation diagram is obtained by connecting critical cells of the slices. In”Birth and Death in Discrete MorseTheory”(King,Knudson,Mramor), a solution about finding the discrete bifurcation diagram has been ...
Discrete discriminant analysis and dependence
Geyik, Cemal; Tuncer, Yalçın; Department of Statistics (1990)
Discrete linear Hamiltonian systems: Lyapunov type inequalities, stability and disconjugacy criteria
Zafer, Ağacık (2012-12-15)
In this paper, we first establish new Lyapunov type inequalities for discrete planar linear Hamiltonian systems. Next, by making use of the inequalities, we derive stability and disconjugacy criteria. Stability criteria are obtained with the help of the Floquet theory, so the system is assumed to be periodic in that case.
Discrete gradient method: Derivative-free method for nonsmooth optimization
Bagirov, A. M.; Karasözen, Bülent; Sezer, M. (2008-05-01)
A new derivative-free method is developed for solving unconstrained nonsmooth optimization problems. This method is based on the notion of a discrete gradient. It is demonstrated that the discrete gradients can be used to approximate subgradients of a broad class of nonsmooth functions. It is also shown that the discrete gradients can be applied to find descent directions of nonsmooth functions. The preliminary results of numerical experiments with unconstrained nonsmooth optimization problems as well as th...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
G. Saldamlı, “Discrete logarithm problem on elliptic curves,” Middle East Technical University, 2000.