Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Entire DC Network
Properties Of Some Matrix Classes In Linear Complementarity Theory., Arup Kumar Das Dr.
Properties Of Some Matrix Classes In Linear Complementarity Theory., Arup Kumar Das Dr.
Doctoral Theses
The linear complementarity problem is a fundamental problem that arises in optimization, game theory, economics, and engineering. It can be stated as follows:Given a square matrix A of order n with real entries and an n dimensional vector q, find n dimensional vectors w and z satisfying w − Az = q, w ≥ 0, z ≥ 0 (1.1.1) w t z = 0. (1.1.2)This problem is denoted as LCP(q, A). The name comes from the condition (1.1.2), the complementarity condition which requires that at least one variable in the pair (wj , zj ) should be equal to 0 …
Design Of Iteration On Hash Functions And Its Cryptanalysis., Mridul Nandi Dr.
Design Of Iteration On Hash Functions And Its Cryptanalysis., Mridul Nandi Dr.
Doctoral Theses
No abstract provided.
Studies On Pairing-Based And Constant Round Dynamic Group Key Agreement., Ratna Dutta Dr.
Studies On Pairing-Based And Constant Round Dynamic Group Key Agreement., Ratna Dutta Dr.
Doctoral Theses
This thesis describes research that I conducted during the course of my Ph.D. study at Indian Statistical Institute (ISI), Kolkata. I hope that this work is of use and will be carried on.I would like to begin by thanking my supervisor, Prof. Rana Barua for his support and endless patience. He has provided me background in Cryptography, Combinatorics and Theory of Automata during the period 2000-2002 of my course work of M.Tech in Computer Science at Indian Statistical Institute. I really appreciate his extraordinary patience in reading my numerous inferior drafts, for listening and analyzing all my ideas, forcing me …