Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

PDF

Indian Statistical Institute

2006

Algorithms

Articles 1 - 2 of 2

Full-Text Articles in Entire DC Network

Properties Of Some Matrix Classes In Linear Complementarity Theory., Arup Kumar Das Dr. Nov 2006

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. May 2006

Design Of Iteration On Hash Functions And Its Cryptanalysis., Mridul Nandi Dr.

Doctoral Theses

No abstract provided.