verification problem
61Iris recognition — Infobox Anatomy Name = Iris Latin = Caption = The iris is the green/grey/brown area. The other structures visible are the pupil in the centre and the white sclera surrounding the iris. The overlying cornea is pictured, but not visible, as it is… …
62Voter Verified Paper Audit Trail — (VVPAT) or Verified Paper Record (VPR) is intended as an independent verification system for voting machines designed to allow voters to verify that their vote was cast correctly, to detect possible election fraud or malfunction, and to provide a …
63DO-178B — / ED 12B Software Considerations in Airborne Systems and Equipment Certification Latest Revision December 1, 1992 Prepared by RTCA SC 167 EUROCAE WG 12 DO 178B, Software Considerations in Airborne Systems and Equipment Certification is a document …
64Java performance — Programs written in Java have had a reputation for being slower and requiring more memory than those written in natively compiled languages such as C or C++ (see e.g. [cite web url=http://www.jelovic.com/articles/why java is slow.htm title=Why… …
65CIA transnational activities in counterproliferation — This article deals with activities of the U.S. Central Intelligence Agency, specifically dealing with arms control, weapons of mass destruction (WMD) and weapons proliferation. It attempts to look at the process of tasking and analyzing, rather… …
66Список терминов, относящихся к алгоритмам и структурам данных —   Это служебный список статей, созданный для координации работ по развитию темы.   Данное предупреждение не устанавливается на информационные списки и глоссарии …
67Список терминов — Список терминов, относящихся к алгоритмам и структурам данных   Это сл …
68Category:Logic in computer science — Logic in computer science is that branch of mathematical logic which is approximately the intersection between mathematical logic and computer science. It contains: Those investigations into logic that are guided by applications in computer… …
69Wikipedia:Featured article candidates — Here, we determine which articles are to be featured articles (FAs). FAs exemplify Wikipedia s very best work and satisfy the FA criteria. All editors are welcome to review nominations; please see the review FAQ. Before nominating an article,… …
70NP (complexity) — Diagram of complexity classes provided that P ≠ NP. The existence of problems outside both P and NP complete in this case was established by Ladner.[1] In computational complexity theory, NP is one of the most fundamental complexity classes. The… …
