NanoparticleA nanoparticle or ultrafine particle is usually defined as a particle of matter that is between 1 and 100 nanometres (nm) in diameter. The term is sometimes used for larger particles, up to 500 nm, or fibers and tubes that are less than 100 nm in only two directions. At the lowest range, metal particles smaller than 1 nm are usually called atom clusters instead.
Silver nanoparticleSilver nanoparticles are nanoparticles of silver of between 1 nm and 100 nm in size. While frequently described as being 'silver' some are composed of a large percentage of silver oxide due to their large ratio of surface to bulk silver atoms. Numerous shapes of nanoparticles can be constructed depending on the application at hand. Commonly used silver nanoparticles are spherical, but diamond, octagonal, and thin sheets are also common. Their extremely large surface area permits the coordination of a vast number of ligands.
Colloidal goldColloidal gold is a sol or colloidal suspension of nanoparticles of gold in a fluid, usually water. The colloid is coloured usually either wine red (for spherical particles less than 100 nm) or blue-purple (for larger spherical particles or nanorods). Due to their optical, electronic, and molecular-recognition properties, gold nanoparticles are the subject of substantial research, with many potential or promised applications in a wide variety of areas, including electron microscopy, electronics, nanotechnology, materials science, and biomedicine.
Platinum nanoparticlePlatinum nanoparticles are usually in the form of a suspension or colloid of nanoparticles of platinum in a fluid, usually water. A colloid is technically defined as a stable dispersion of particles in a fluid medium (liquid or gas). Spherical platinum nanoparticles can be made with sizes between about 2 and 100 nanometres (nm), depending on reaction conditions. Platinum nanoparticles are suspended in the colloidal solution of brownish-red or black color. Nanoparticles come in wide variety of shapes including spheres, rods, cubes, and tetrahedra.
NP-completenessIn computational complexity theory, a problem is NP-complete when: It is a decision problem, meaning that for any input to the problem, the output is either "yes" or "no". When the answer is "yes", this can be demonstrated through the existence of a short (polynomial length) solution. The correctness of each solution can be verified quickly (namely, in polynomial time) and a brute-force search algorithm can find a solution by trying all possible solutions.
Nanoparticle–biomolecule conjugateA nanoparticle–biomolecule conjugate is a nanoparticle with biomolecules attached to its surface. Nanoparticles are minuscule particles, typically measured in nanometers (nm), that are used in nanobiotechnology to explore the functions of biomolecules. Properties of the ultrafine particles are characterized by the components on their surfaces more so than larger structures, such as cells, due to large surface area-to-volume ratios. Large surface area-to-volume-ratios of nanoparticles optimize the potential for interactions with biomolecules.
P versus NP problemThe P versus NP problem is a major unsolved problem in theoretical computer science. In informal terms, it asks whether every problem whose solution can be quickly verified can also be quickly solved. The informal term quickly, used above, means the existence of an algorithm solving the task that runs in polynomial time, such that the time to complete the task varies as a polynomial function on the size of the input to the algorithm (as opposed to, say, exponential time).
Well-founded relationIn mathematics, a binary relation R is called well-founded (or wellfounded or foundational) on a class X if every non-empty subset S ⊆ X has a minimal element with respect to R, that is, an element m ∈ S not related by s R m (for instance, "s is not smaller than m") for any s ∈ S. In other words, a relation is well founded if Some authors include an extra condition that R is set-like, i.e., that the elements less than any given element form a set.
Non-well-founded set theoryNon-well-founded set theories are variants of axiomatic set theory that allow sets to be elements of themselves and otherwise violate the rule of well-foundedness. In non-well-founded set theories, the foundation axiom of ZFC is replaced by axioms implying its negation. The study of non-well-founded sets was initiated by Dmitry Mirimanoff in a series of papers between 1917 and 1920, in which he formulated the distinction between well-founded and non-well-founded sets; he did not regard well-foundedness as an axiom.
Well-orderIn mathematics, a well-order (or well-ordering or well-order relation) on a set S is a total order on S with the property that every non-empty subset of S has a least element in this ordering. The set S together with the well-order relation is then called a well-ordered set. In some academic articles and textbooks these terms are instead written as wellorder, wellordered, and wellordering or well order, well ordered, and well ordering. Every non-empty well-ordered set has a least element.
