Mathematician
•
University of California, Berkeley alumni
•
American computer scientists
•
21st-century mathematicians
•
Indian Hindus
•
California Institute of Technology alumni
Indian emigrants to the United States
Theoretical computer scientists
ISI highly cited researchers
Numerical analysts
American operations researchers
Indian operations researchers
Indian Institute of Technology Bombay alumni
Indian computer scientists
20th-century mathematicians
Scientists at Bell Labs
1957 births
List of Indian mathematicians
Narendra Karmarkar
Narendra Krishna Karmarkar (born 1957) is an Indian mathematician, who developed Karmarkar's algorithm. He is listed as an ISI highly cited researcher.
Narendra Karmarkar was born in a Maharashtr...
Karmarkar's algorithm
•
Computer architecture
•
Finite geometry
•
Galois geometry
•
Finite field
•
Linear code
•
Projective geometry
Karmarkar's algorithm
Karmarkar's algorithm is an algorithm introduced by Narendra Karmarkar in 1984 for solving linear programming problems. It was the first reasonably efficient algorithm that solves these problems in po...
Karmarkar's algorithm - Wikipedia
Computer architecture
In computer engineering, computer architecture is a set of disciplines that describes the functionality, the organization and the implementation of computer systems; that is, it defines the capabiliti...
Finite geometry
A finite geometry is any geometric system that has only a finite number of points.The familiar Euclidean geometry is not finite, because a Euclidean line contains infinitely many points. A geometry ba...
Finite geometry - Wikipedia
Galois geometry
Galois geometry (so named after the 19th century French Mathematician Évariste Galois) is the branch of finite geometry that is concerned with algebraic and analytic geometry over a finite field (or G...
Finite field
In algebra, a finite field or Galois field (so named in honor of Évariste Galois) is a field that contains a finite number of elements, called its order (the size of the underlying set). As with any ...
Linear code
In coding theory, a linear code is an error-correcting code for which any linear combination of codewords is also a codeword. Linear codes are traditionally partitioned into block codes and convolutio...
Projective geometry
In mathematics, projective geometry is the study of geometric properties that are invariant under projective transformations. This means that, compared to elementary geometry, projective geometry has ...
Projective cone
A projective cone (or just cone) in projective geometry is the union of all lines that intersect a projective subspace R (the apex of the cone) and an arbitrary subset A (the basis) of some other subs...
Plücker coordinates
In geometry, Plücker coordinates, introduced by Julius Plücker in the 19th century, are a way to assign six homogeneous coordinates to each line in projective 3-space, P. Because they satisfy a quadra...
Plücker coordinates - Wikipedia
Imaginary curve
In algebraic geometry an imaginary curve is an algebraic curve which does not contain any real points.For example, the set of pairs of complex numbers satisfying the equation forms an imaginary circ...
Real projective line
In projective geometry and real analysis, the real projective line (also called the one-point compactification of the real line, or the projectively extended real numbers), is the set , also denoted b...
Real projective line - Wikipedia
Five points determine a conic
In Euclidean, non-projective geometry, just as two (distinct) points determine a line (a degree-1 plane curve), five points determine a conic (a degree-2 plane curve). There are additional subtleties ...
Five points determine a conic - Wikipedia
Low-power electronics
Low-power electronics are electronics that have been designed to use less electric power, e.g. notebook processors.
The earliest attempts to reduce the amount of power required by an electronic de...
Segre embedding
In mathematics, the Segre embedding is used in projective geometry to consider the cartesian product (of sets) of two projective spaces as a projective variety. It is named after Corrado Segre.
Th...
Projective polyhedron
In geometry, a (globally) projective polyhedron is a tessellation of the real projective plane. These are projective analogs of spherical polyhedra – tessellations of the sphere – and toroidal polyhed...
Projective polyhedron - Wikipedia
Microarchitecture
In computer engineering, microarchitecture (sometimes abbreviated to µarch or uarch), also called computer organization, is the way a given instruction set architecture (ISA) is implemented on a proce...
Microarchitecture - Wikipedia
Projectivization
In mathematics, projectivization is a procedure which associates with a non-zero vector space V a projective space , whose elements are one-dimensional subspaces of V. More generally, any subset S of ...
Desarguesian plane
In mathematics, a projective plane is a geometric structure that extends the concept of a plane. In the ordinary Euclidean plane, two lines typically intersect in a single point, but there are some pa...
Berlekamp's algorithm
In mathematics, particularly computational algebra, Berlekamp's algorithm is a well-known method for factoring polynomials over finite fields (also known as Galois fields). The algorithm consists mai...
Pappus's hexagon theorem
In mathematics, Pappus' hexagon theorem (attributed to Pappus of Alexandria) states that given one set of collinear points A, B, C, and another set of collinear points a, b, c, then the intersection p...
Pappus's hexagon theorem - Wikipedia
Fubini-Study metric
In mathematics, the Fubini–Study metric is a Kähler metric on projective Hilbert space, that is, complex projective space CP endowed with a Hermitian form. This metric was originally described in 190...
Fubini-Study metric - Wikipedia
Cayley plane
In mathematics, the Cayley plane (or octonionic projective plane) P(O) is a projective plane over the octonions. It was discovered in 1933 by Ruth Moufang, and is named after Arthur Cayley (for his 18...
Cayley plane - Wikipedia
Inverse curve
In geometry, an inverse curve of a given curve C is the result of applying an inverse operation to C. Specifically, with respect to a fixed circle with center O and radius k the inverse of a point Q i...
Inverse curve - Wikipedia
Geometric tomography
Geometric tomography is a mathematical field that focuses on problems of reconstructing homogeneous (often convex) objects from tomographic data (this might be X-rays, projections, sections, brightnes...
Hemi-icosahedron
A hemi-icosahedron is an abstract regular polyhedron, containing half the faces of a regular icosahedron. It can be realized as a projective polyhedron (a tessellation of the real projective plane by ...
Hemi-icosahedron - Wikipedia
Near-field (mathematics)
In mathematics, a near-field is an algebraic structure similar to a division ring, except that it has only one of the two distributive laws. Alternatively, a near-field is a near-ring in which there i...
Projective range
In mathematics, a projective range is a set of points in projective geometry considered in a unified fashion. A projective range may be a projective line or a conic. A projective range is the dual of ...
Hamming code
In telecommunication, Hamming codes are a family of linear error-correcting codes that generalize the Hamming(7,4)-code invented by Richard Hamming in 1950. Hamming codes can detect up to two-bit erro...
Arc (projective geometry)
A (simple) arc in finite projective geometry is a set of points which satisfies, in an intuitive way, a feature of curved figures in continuous geometries. Loosely speaking, they are sets of points th...
Arc (projective geometry) - Wikipedia
Tetrahemihexahedron
In geometry, the tetrahemihexahedron or hemicuboctahedron is a uniform star polyhedron, indexed as U4. It has 6 vertices and 12 edges, and 7 faces: 4 triangular and 3 square. Its vertex figure is a cr...
Tetrahemihexahedron - Wikipedia