Search results
Results from the WOW.Com Content Network
Physics, mathematics, computer science, nonlinear sciences, quantitative biology and statistics: Repository of electronic pre-prints of papers in the fields of mathematics, physics, astronomy, computer science, quantitative biology, statistics, and quantitative finance. Free Cornell University [18] ASCE Library: Civil engineering
DBLP (Digital Bibliography & Library Project in computer science) The Collection of Computer Science Bibliographies; Lists. List of computer science conferences; List of computer science conference acronyms; List of open problems in computer science; List of mathematics journals; Categories. Biomedical informatics journals; Computational ...
AKS primality test – The AKS primality test is a deterministic primality-proving algorithm created and published by three Indian Institute of Technology Kanpur computer scientists, Manindra Agrawal, Neeraj Kayal, and Nitin Saxena on 6 August 2002 in a paper titled PRIMES is in P.
The Indian Citation Index (ICI) is an online bibliographic database that includes abstracts and citations from over 1100 academic journals in India, spanning scientific, technical, medical, and social sciences, including arts and humanities. The database covers data from 2004 onwards and offers full-text access to titles from Open Access ...
The Indian Association for Research in Computing Science (IARCS) provides leadership in computing within India. Its members are leading researchers in Computer Science drawn from major institutions from all over the country. Madhavan Mukund was the President of the association as of 2016. IARCS aims to promote excellence in computing.
NC = P problem The P vs NP problem is a major unsolved question in computer science that asks whether every problem whose solution can be quickly verified by a computer (NP) can also be quickly solved by a computer (P). This question has profound implications for fields such as cryptography, algorithm design, and computational theory.
Hilbert matrix — example of a matrix which is extremely ill-conditioned (and thus difficult to handle) Wilkinson matrix — example of a symmetric tridiagonal matrix with pairs of nearly, but not exactly, equal eigenvalues; Convergent matrix — square matrix whose successive powers approach the zero matrix; Algorithms for matrix multiplication:
These are lists of research topics, research problems and current research activities in various scientific areas. Pages in category "Lists of research topics" The following 3 pages are in this category, out of 3 total.