AI & ChatGPT searches , social queriess for NP EQUIVALENT
Search references for NP EQUIVALENT. Phrases containing NP EQUIVALENT
See searches and references containing NP EQUIVALENT!
Search references for NP EQUIVALENT. Phrases containing NP EQUIVALENT
See searches and references containing NP EQUIVALENT!NP EQUIVALENT
complexity class NP-equivalent is the set of function problems that are both NP-easy and NP-hard. NP-equivalent is the analogue of NP-complete for function
NP-equivalent
Complexity class
as hard as NP, but not necessarily in NP. NP-equivalent Decision problems that are both NP-hard and NP-easy, but not necessarily in NP. NP-intermediate
NP-hardness
Complexity class used to classify decision problems
definition is the basis for the abbreviation NP; "nondeterministic, polynomial time". These two definitions are equivalent because the algorithm based on the Turing
NP_(complexity)
Unsolved problem in computer science
class NP consists of all decision problems whose positive solutions are verifiable in polynomial time given the right information, or equivalently, whose
P_versus_NP_problem
Therefore, sorting is NP-easy. There are also more difficult problems that are NP-easy. See NP-equivalent for an example. The definition of NP-easy uses a Turing
NP-easy
Complexity class
theory, NP-complete problems are the hardest of the problems to which solutions can be verified quickly. Somewhat more precisely, a problem is NP-complete
NP-completeness
Set of computational problems stated by Richard Karp (1973)
computational complexity theory, Karp's 21 NP-complete problems are a set of computational problems which are NP-complete. In his 1972 paper, "Reducibility
Karp's 21 NP-complete problems
Karp's_21_NP-complete_problems
Boolean satisfiability is NP-complete and therefore that NP-complete problems exist
such an algorithm for Boolean satisfiability exists is thus equivalent to the P versus NP problem, which is still widely considered the most important
Cook–Levin_theorem
This is a list of some of the more commonly known problems that are NP-complete when expressed as decision problems. As there are thousands of such problems
List_of_NP-complete_problems
Complexity class
co-NP; i.e., co-NP ⊆ NP {\displaystyle {\textsf {co-NP}}\subseteq {\textsf {NP}}} . Thus co-NP = NP {\displaystyle {\textsf {co-NP}}={\textsf {NP}}}
Co-NP
example, if a language L is in NP then the complement of L is in co-NP. (This does not mean that the complement of NP is co-NP—there are languages which are
List_of_complexity_classes
Mid-level medical provider
A nurse practitioner (NP) is an advanced practice registered nurse and a type of mid-level practitioner. NPs are trained to assess patient needs, order
Nurse_practitioner
Probability distribution
np\pm 3{\sqrt {np(1-p)}}\in (0,n)} is totally equivalent to request that n p − 3 n p ( 1 − p ) > 0 and n p + 3 n p ( 1 − p ) < n . {\displaystyle np-3{\sqrt
Binomial_distribution
Computer science concept
hierarchy) is a hierarchy of complexity classes that generalize the classes NP and co-NP. Each class in the hierarchy is contained within PSPACE. The hierarchy
Polynomial_hierarchy
Seven mathematical problems with a US$1 million prize for each solution
class of problems termed NP, while the latter describes P, the question is equivalent to asking whether all problems in NP are also in P. This is generally
Millennium_Prize_Problems
Chemical element with atomic number 93 (Np)
Neptunium is a chemical element; it has symbol Np and atomic number 93. A radioactive actinide metal, neptunium is the first transuranic element. It is
Neptunium
Subset of a graph's vertices, including at least one endpoint of every edge
are equivalent under polynomial-time reduction by using binary search. The vertex cover problem is an NP-complete problem: it was one of Karp's 21 NP-complete
Vertex_cover
Subfield of mathematical optimization
polynomial-time algorithms, whereas mathematical optimization is in general NP-hard. A convex optimization problem is defined by two ingredients: The objective
Convex_optimization
Algorithm characteristic in computations
algorithm for NP-complete problems is generally characterized as one which runs in polynomial time for all inputs; this is equivalent to requiring efficient
Average-case_complexity
Theoretical model of computation
problems in theoretical computer science is the P versus NP problem, which (among other equivalent formulations) concerns the question of how difficult it
Nondeterministic Turing machine
Nondeterministic_Turing_machine
Problem of determining if a Boolean formula could be made true
problem that was proven to be NP-complete—this is the Cook–Levin theorem. This means that all problems in the complexity class NP, which includes a wide range
Boolean satisfiability problem
Boolean_satisfiability_problem
Vertices whose removal breaks all cycles
feedback vertex set of size at most k is an NP-complete problem; it was among the first problems shown to be NP-complete. It has wide applications in operating
Feedback_vertex_set
Indian combat aircraft
Prototypes (NP) NP-1 (KHN-T3001) – Two-seat naval variant for carrier operations. Rolled out in July 2010. NP-1 made its first flight on 27 April 2012. NP-2 (NAVY3002)
HAL_Tejas
List of unsolved computational problems
experts in the field disagree about proposed solutions. P versus NP problem – The P vs NP problem is a major unsolved question in computer science that asks
List of unsolved problems in computer science
List_of_unsolved_problems_in_computer_science
When a finite set S of relations yields polynomial-time or NP-complete problems
dual-Horn clauses; all relations are equivalent to a conjunction of affine formulae. Otherwise, the problem SAT(S) is NP-complete. A modern, streamlined presentation
Schaefer's_dichotomy_theorem
In logic, a statement which is always true
satisfiability problem is NP-complete, and consequently, tautology is co-NP-complete. It is widely believed that (equivalently for all NP-complete problems)
Tautology_(logic)
Abstract machine used to study decision problems
Other relativized complexity classes such as N P R {\displaystyle {\mathsf {NP}}^{R}} can be defined analogously. An oracle machine can be conceived as
Oracle_machine
Set of problems in computational complexity theory
then P=NP (it is not known whether this holds in the reverse, i.e. whether P=NP implies #P=FP). Just as FP is the function problem equivalent of P, FNP
Complexity_class
Mathematical optimization problem restricted to integers
integer constraints) are linear. Integer programming is NP-complete (the difficult part is showing the NP membership). In particular, the special case of 0–1
Integer_programming
Phrase which grammatically functions the same as a noun
A noun phrase – or NP or nominal (phrase) – is a phrase that usually has a noun or pronoun as its head, and has the same grammatical functions as a noun
Noun_phrase
Unsolved problem in computational complexity theory
P ≠ NP, then for many important problems it is not only impossible to get an exact solution in polynomial time (as postulated by the P versus NP problem)
Unique_games_conjecture
Boolean satisfiability problem restricted to a planar incidence graph
planar equivalent of 1-in-3SAT. It is NP-complete. Planar positive rectilinear 1-in-3SAT: This is the planar equivalent of positive 1-in-3SAT. It is NP-complete
Planar_SAT
Nepal secondary school leaving examination
for?". Acronym finder. Retrieved 20 November 2011. "हाम्रो बारेमा". neb.gov.np. Retrieved 2026-04-20. "SEE: Everything You Need to Know About Nepal's National
School Leaving Certificate (Nepal)
School_Leaving_Certificate_(Nepal)
Problem in computer science
packing is a classical NP-complete problem in computational complexity theory and combinatorics, and was one of Karp's 21 NP-complete problems. Suppose
Set_packing
Python library for numerical programming
to q: [3, 4, 4] ### Equivalent NumPy vectorization ### import numpy as np from numpy.typing import NDArray points: NDArray[int] = np.array([[9,2,8],[4,7
NumPy
Classical problem in combinatorics
covering is NP-complete. It is one of Karp's 21 NP-complete problems shown to be NP-complete in 1972. The optimization/search version of set cover is NP-hard
Set_cover_problem
Difficulty measures for computer science problems
and complementation) of NP sets. Equivalently, the Boolean hierarchy can be described as the class of Boolean circuits over NP predicates. A collapse of
Boolean_hierarchy
Unsolved problem in computational complexity theory
solvable in polynomial time nor to be NP-complete, and therefore may be in the computational complexity class NP-intermediate. It is known that the graph
Graph_isomorphism_problem
Logarithmic unit for ratios of measurements of physical field and power quantities
The neper (symbol: Np) is a logarithmic unit for ratios of measurements of physical field and power quantities, such as gain and loss of electronic signals
Neper
Problem of finding a cycle through all vertices of a graph
is NP-Complete meaning it can be mapping reduced to the 3-SAT problem. As a result, finding a solution to the Hamiltonian Path problem is equivalent to
Hamiltonian_path_problem
In computational complexity theory, NP/poly is a complexity class, a non-uniform analogue of the class NP of problems solvable in polynomial time by a
NP/poly
Internet top-level domain used by the US government
require a two-letter United States postal abbreviations or state name equivalent, though exceptions are made. Rules have been established for municipalities
.gov
Field-equations in general relativity
R} and substituting this in the original EFE, one gets the following equivalent "trace-reversed" form: R μ ν − 2 D − 2 Λ g μ ν = κ ( T μ ν − 1 D − 2 T
Einstein_field_equations
Sentence composed of homonyms
Borgmann's Beyond Language: Adventures in Word and Thought. A semantically equivalent form preserving the original word order is: "Buffalonian bison [whom other]
Buffalo buffalo Buffalo buffalo buffalo buffalo Buffalo buffalo
Buffalo_buffalo_Buffalo_buffalo_buffalo_buffalo_Buffalo_buffalo
Branch of computational complexity theory
of efficient, exact, and deterministic solving algorithms for NP-complete, or otherwise NP-hard, problems is considered unlikely, if input parameters are
Parameterized_complexity
Military unit
responsible for the maintenance and security of three uniquely configured NP-3C Orion turboprop research aircraft, a Beechcraft RC-12M Guardrail aircraft
VXS-1
Logic puzzle
known to be NP-complete. This was proven by Friedman (2002) by constructing puzzles equivalent to arbitrary Boolean circuits, which shows NP-completeness
Tentai_Show
Problem in combinatorial optimization
specifically to the subset sum problem. The subset sum problem is one of Karp's 21 NP-complete problems. Knapsack problems appear in real-world decision-making
Knapsack_problem
Unsolved problem in structural complexity theory
paddable NP-complete languages are p-isomorphic. Since p-isomorphism preserves paddability, and there exist paddable NP-complete languages, an equivalent way
Berman–Hartmanis_conjecture
Group of chemical compounds
Np3+, Np4+, NpO+ 2, NpO2+ 2, and NpO+ 3. In basic solutions, they exist as the oxides and hydroxides Np(OH)3, NpO2, NpO2OH, NpO2(OH)2, and NpO3− 5. Not
Neptunium_compounds
Internet top-level domain
India (co.in), Indonesia (co.id), Japan (co.jp), Mexico (com.mx), Nepal (.com.np), Pakistan (.com.pk), South Korea (co.kr), Sri Lanka (com.lk), United Kingdom
.com
Abstract machine that models computation
be reduced to ϵ ℓ {\displaystyle \epsilon ^{\ell }} . The complexity class NP may be viewed as a very simple proof system. In this system, the verifier
Interactive_proof_system
domains. Solving a constraint satisfaction problem on a finite domain is an NP-complete problem in general. Research has shown a number of polynomial-time
Complexity of constraint satisfaction
Complexity_of_constraint_satisfaction
, r 1 , … {\displaystyle \pi '=r_{0},r_{1},\ldots } being stuttering equivalent ( π ∼ s t π ′ {\displaystyle \pi \sim _{st}\pi '} ) if there are two infinite
Stuttering_equivalence
Optimization problem
problem (TSP), which is equivalent to requiring a single route to visit all locations. As the TSP is NP-hard, the VRP is also NP-hard. VRP has many direct
Vehicle_routing_problem
System responsible for combining morphemes into complex structures
as (NP/(NP\S)), which means, "A category that searches to the right (indicated by /) for an NP (the object) and generates a function (equivalent to the
Syntax
Class of problems in computer science
scheduling problem is equivalent to finding the maximum independent set in this intersection graph. Finding a maximum independent set is NP-hard in general
Interval_scheduling
Partition into subsets from a given family
choices and the elements of X {\displaystyle X} represent constraints. It is NP-hard and has a variety of applications, ranging from the optimization of airline
Exact_cover
Field in logic and theoretical computer science
system that admits polynomial size proofs for all tautologies is equivalent to NP = co-NP. Contemporary proof complexity research draws ideas and methods
Proof_complexity
most Δ² + 2Δ + 1. Finding a radio coloring with a given (or minimum) span is NP-complete, even when restricted to planar graphs, split graphs, or the complements
Radio_coloring
Function in algebraic graph theory
k-colored is NP-hard. Such problems cannot be approximated to any multiplicative factor by a bounded-error probabilistic algorithm unless NP = RP, because
Chromatic_polynomial
Chemical compound
carbonate equivalent, abbreviated LCE, is an industry standard for lithium compounds whose lithium content is expressed in weight-equivalent of lithium
Lithium_carbonate
NP-hard problem in combinatorial optimization
that visits each city exactly once and returns to the origin city?" It is an NP-hard problem in combinatorial optimization, important in theoretical computer
Travelling_salesman_problem
Problem of finding the longest simple path for a given graph
path problem is NP-hard and the decision version of the problem, which asks whether a path exists of at least some given length, is NP-complete. This means
Longest_path_problem
On short connecting nets with added points
given threshold, is NP-complete, which implies that the optimization variant, asking for the minimum-weight tree in a given graph, is NP-hard. In fact, the
Steiner_tree_problem
On collapse of the polynomial hierarchy if NP is in non-uniform polynomial time class
size circuits for SAT or for other NP-complete problems. A proof that such circuits do not exist would imply that P ≠ NP. As P/poly contains all problems
Karp–Lipton_theorem
Computation modulo a fixed integer
encryption. These problems might be NP-intermediate. Solving a system of non-linear modular arithmetic equations is NP-complete. Boolean ring Circular buffer
Modular_arithmetic
Classic NP-complete problem in computer science
satisfiability problem (SAT), and likewise, has been proven to be NP-complete. It is a prototypical NP-complete problem; the Cook–Levin theorem is sometimes proved
Circuit satisfiability problem
Circuit_satisfiability_problem
Country in South Asia
Birmingham: UK:GSDRC. https://web.archive.org/web/20220206104652/https://cbs.gov.np/wp-content/upLoads/2022/01/Final%20Preliminary%20Report%20of%20Census%202021%20Newfinal
Nepal
Methodic assignment of colors to elements of a graph
number problem (see section § Vertex coloring below) is one of Karp's 21 NP-complete problems from 1972, and at approximately the same time various exponential-time
Graph_coloring
Type of polynomial sequence
be equivalent: For n = 1 , 2 , 3 , … {\displaystyle n=1,2,3,\ldots } , d d x p n ( x ) = n p n − 1 ( x ) {\displaystyle {\frac {d}{dx}}p_{n}(x)=np_{n-1}(x)}
Appell_sequence
transversal, or equivalently the largest bipartite induced subgraph, is also called odd cycle transversal, and abbreviated as OCT. It is NP-hard, as a special
Odd_cycle_transversal
Convergence in distribution of binomial to normal distribution
distribution with expectation n p {\displaystyle np} and standard deviation n p ( 1 − p ) {\textstyle {\sqrt {np(1-p)}}} , as n {\displaystyle n} grows large
De_Moivre–Laplace_theorem
Decision problem in computer science
{\displaystyle T} . The problem is known to be NP-complete. Moreover, some restricted variants of it are NP-complete too, for example: The variant in which
Subset_sum_problem
Graph data structure
minimal total cost that is represented by the given e-class. This problem is NP-hard. There is also no constant-factor approximation algorithm for this problem
E-graph
Estimate of time taken for running an algorithm
ETH is equivalent to the hypothesis that kSAT cannot be solved in time 2o(m) for any integer k ≥ 3. The exponential time hypothesis implies P ≠ NP. An algorithm
Time_complexity
Logarithmic unit expressing the ratio of physical quantities
1/2 ln(10) Np. The neper is the change in the level of a root-power quantity when the root-power quantity changes by a factor of e, that is 1 Np = ln(e)
Decibel
Tree graph with all nodes within distance 1 from central path
(sequence A005418 in the OEIS). Finding a spanning caterpillar in a graph is NP-complete. A related optimization problem is the Minimum Spanning Caterpillar
Caterpillar_tree
Large cardinal number that is hard to describe in a given language
{\displaystyle \Pi _{m}^{n}} -indescribable for all positive integers m and n.p. 59 If α {\displaystyle \alpha } is an ordinal, the cardinal number κ {\displaystyle
Indescribable_cardinal
Relationship between two numbers of the same kind
s, p:q∷r:s if and only if, for any positive integers m and n, np < mq, np = mq, or np > mq according as nr < ms, nr = ms, or nr > ms, respectively. This
Ratio
Pharmaceutical compound
respect to entheogenic effects 10 mg of ergonovine maleate is roughly equivalent to 50 μg is, ergonovine possesses about that LSD-tartrate, 1/200th the
Isoergine
Series of digital compact cameras
and X100VI. They each have a large image sensor and a 23 mm lens (35 mm equivalent angle of view in full frame format). All six cameras have received generally
Fujifilm_X100
Problem in graph theory
known to be NP-complete. It is easy to see that the problem is in NP: a yes answer is easy to prove by presenting a large enough cut. The NP-completeness
Maximum_cut
Mathematical-logic system based on functions
"equivalence" and "reduction" that make it possible to reduce lambda terms to equivalent lambda terms. α-conversion captures the intuition that the particular
Lambda_calculus
Ability of a circuit to increase the power or amplitude of a signal
gain-np = 1 2 ln ( P out P in ) Np . {\displaystyle {\text{gain-np}}={\frac {1}{2}}\ln \left({\frac {P_{\text{out}}}{P_{\text{in}}}}\right)~{\text{Np}}
Gain_(electronics)
Axiom of set theory
provable in ZFC. Statements in this class include the statement that P = NP, the Riemann hypothesis, and many other unsolved mathematical problems. When
Axiom_of_choice
Molecule containing main group elements with more than eight valence electrons
theory. This approach defines a parameter called the valence electron equivalent, γ, as "the formal shared electron count at a given atom, obtained by
Hypervalent_molecule
Type of task difficulty
by analogy to "NP-completeness" in complexity theory, a term to indicate that the difficulty of a computational problem is equivalent to solving the central
ASR-complete
Constructed language created in 1998
relational in-fiction, "In many ways it expresses the same thing as LA NP pa NP", but indicates a passive meaning. Pa is never inflected. "An Introduction
Kēlen
Amount of resources to perform an algorithm
non-deterministic machine. A problem is NP-complete if, roughly speaking, it is in NP and is not easier than any other NP problem. Many combinatorial problems
Computational_complexity
g\colon J\to I} . Deciding whether two graphs are homomorphically equivalent is NP-complete. In fact for any category C, one can define homomorphic equivalence
Homomorphic_equivalence
Method for solving one problem using another
problem is NP-complete if it belongs to NP and all problems in NP have polynomial-time many-one reductions to it. A problem that belongs to NP can be proven
Polynomial-time_reduction
In computer vision and image processing
will throw a warning that can safely be ignored. """ return np.nansum( [ np.mean(cls) * np.var(image, where=cls) # weight · intra-class variance for cls
Otsu's_method
Brand of digital cameras by Casio
WAV and MP3. Casio's NP-20 batteries are claimed to hold 700 mAh of charge, while the thicker NP-40 is rated for 1230 mAh and the NP-90 has 1700mAh.. Casio
Casio_Exilim
Tabular arrangement of the chemical elements
p-block elements (where the ns electrons become lower in energy than the np) tend to vary by steps of 2, because that is necessary to uncover an inner
Periodic_table
Unproven computational hardness assumption
exponential time hypothesis, if true, would imply that P ≠ NP, but it is a stronger statement. Beyond NP-complete problems, it implies that many known algorithms
Exponential_time_hypothesis
Compiler that optimizes generated code
factors. Theoretical analysis indicates that some optimization problems are NP-complete, or even undecidable. Also, producing perfectly optimal code is not
Optimizing_compiler
Transformation of statistics by limiting extreme values
winsorize data using SciPy library: import numpy as np from scipy.stats.mstats import winsorize winsorize(np.array([92, 19, 101, 58, 1053, 91, 26, 78, 10, 13
Winsorizing
Subset of a graph's nodes such that all other nodes link to at least one
> 0 unless P = NP. The following two reductions show that the minimum dominating set problem and the set cover problem are equivalent under L-reductions:
Dominating_set
Unsolved problem in graph theory
If Barnette's conjecture turns out to be false, then it can be shown to be NP-complete to test whether a bipartite cubic polyhedron is Hamiltonian. If a
Barnette's_conjecture
NP EQUIVALENT
NP EQUIVALENT
Surname or Lastname
English
English : variant spelling of Lawrence.French : from the female personal name Laurence, a feminine equivalent of Lawrence.
Surname or Lastname
Irish
Irish : adopted as an English equivalent of Gaelic Ó Maoil Fhábhail ‘descendant of Maolfhábhail’, a personal name meaning ‘fond of movement or travel’.English : from the common French place name Laval, from Old French val ‘valley’. This is also a Huguenot name (with the same etymology), taken to England by Etienne-Abel Laval, a minister of the French church in Castle Street, London, around 1730.French : habitational name from Lavelle in Puy-de-Dôme or various other, smaller places so named.
Surname or Lastname
English
English : variant of Keighley.Irish : also found in Ireland as an equivalent of Gately.
Surname or Lastname
English and French
English and French : nickname for a tall person, from Old English lang, long, Old French long ‘long’, ‘tall’ (equivalent to Latin longus).Irish (Ulster (Armagh) and Munster) : reduced Anglicized form of Gaelic Ó Longáin (see Langan).Chinese : from the name of an official treasurer called Long, who lived during the reign of the model emperor Shun (2257–2205 bc). his descendants adopted this name as their surname. Additionally, a branch of the Liu clan (see Lau 1), descendants of Liu Lei, who supposedly had the ability to handle dragons, was granted the name Yu-Long (meaning roughly ‘resistor of dragons’) by the Xia emperor Kong Jia (1879–1849 bc). Some descendants later simplified Yu-Long to Long and adopted it as their surname.Chinese : there are two sources for this name. One was a place in the state of Lu in Shandong province during the Spring and Autumn period (722–481 bc). The other source is the Xiongnu nationality, a non-Han Chinese people.Chinese : variant of Lang.Cambodian : unexplained.
Surname or Lastname
English
English : patronymic from Mann 1 and 2.Irish : adopted as an English equivalent of Gaelic Ó MainnÃn ‘descendant of MainnÃn’, probably an assimilated form of MainchÃn, a diminutive of manach ‘monk’. This is the name of a chieftain family in Connacht. It is sometimes pronounced Ó MaingÃn and Anglicized as Mangan.Anstice Manning, widow of Richard Manning of Dartmouth, England, came to MA with her children in 1679. Her great-great-grandson Robert, born at Salem, MA, in 1784, was the uncle and protector of author Nathaniel Hawthorne. Another early bearer of the relatively common British name was Jeffrey Manning, one of the earliest settlers in Piscataway township, Middlesex Co., NJ. His great-grandson James Manning (1738–91) was a founder and the first president of Rhode Island College (Brown University).
Surname or Lastname
English
English : habitational name from any of the numerous places in northern England called Kirby or Kirkby, from Old Norse kirkja ‘church’ + býr ‘settlement’.Irish : adopted as an English equivalent of Gaelic Ó Garmhaic ‘descendant of Ciarmhac’, a personal name meaning ‘dark son’. Compare Kerwick.
Surname or Lastname
English (of Norman origin)
English (of Norman origin) : via Old French from the Germanic personal name Milo, of unknown etymology. The name was introduced to England by the Normans in the form Miles (oblique case Milon). In English documents of the Middle Ages the name sometimes appears in the Latinized form Milo (genitive Milonis), although the normal Middle English form was Mile, so the final -s must usually represent the possessive ending, i.e. ‘son or servant of Mile’.English : patronymic from the medieval personal name Mihel, an Old French contracted form of Michael.English : occupational name for a servant or retainer, from Latin miles ‘soldier’, sometimes used as a technical term in this sense in medieval documents.Irish (County Mayo) : when not the same as 1 or 3, an Anglicized form of Gaelic Ó Maolmhuire, Myles being used as the English equivalent of the Gaelic personal name Maol Muire (see Mullery).Jewish (eastern Ashkenazic) : unexplained.Dutch : variant of Miels, a variant of Miele 3.John Miles or Myles (c.1621–83), born probably in Herefordshire, England, was a pioneer American Baptist minister who emigrated to New England in 1662 and had a pastorate in Swansea, MA. Many of his descendants spell their name Myles.
Surname or Lastname
English
English : from a pet form of the female personal name Elizabeth. Compare Hibbs 2.English : nickname for someone with very fair hair or skin, from Middle English, Old English lilie ‘lily’ (Latin lilium). The Italian equivalent Giglio was used as a personal name in the Middle Ages. In English and other languages there has also been some confusion with forms of Giles.English : habitational name from places called Lilley, in Hertfordshire and Berkshire. The Hertfordshire place was named in Old English as ‘flax-glade’, from līn ‘flax’ + lēah ‘woodland clearing’. The Berkshire name is from Old English Lillinglēah ‘wood associated with Lilla’, an Old English personal name.
Surname or Lastname
English
English : local name for someone who lived in a small cottage or temporary dwelling, Middle English logge (Old French loge, of Germanic origin). The term was used in particular of a cabin erected by masons working on the site of a particular construction project, such as a church or cathedral, and so it was probably in many cases equivalent to an occupational name for a mason. Reaney suggests that one early form, atte Logge, might sometimes have denoted the warden of a masons’ lodge.Henry Cabot Lodge (1850–1924), the influential U.S. senator from MA, was born in Boston, the only son of John Ellerton Lodge, a prosperous merchant and owner of swift clipper ships engaged in commerce with China, one of several Lodges who emigrated from England in the 18th and 19th centuries.
Surname or Lastname
English
English : from a Middle English personal name derived from the Old English female personal name Lufu ‘love’, or the masculine equivalent Lufa. Compare Leaf 2.English and Scottish : nickname from Anglo-Norman French lo(u)ve ‘female wolf’ (a feminine form of lou). This nickname was fairly commonly used for men, in an approving sense. No doubt it was reinforced by crossing with post-Conquest survivals of the masculine version of 1.Scottish : see McKinnon.Dutch (de Love) : respelling and reinterpretation of Delhove, a habitational name from Hove and L’Hoves in Hainault, for example.
Surname or Lastname
English
English : from a relatively rare medieval personal name derived from the Latin saint’s name Marinus (or possibly from its feminine equivalent, Marina).
Surname or Lastname
Southern Italian
Southern Italian : nickname for a fierce or brave warrior, from Latin leo ‘lion’.Italian : from a short form of the personal name Pantaleo.Jewish : from the personal name Leo (from Latin leo ‘lion’), borrowed from Christians as an equivalent of Hebrew Yehuda (see Leib 3).English : from the Old French personal name Leon ‘lion’ (see Lyon 2).Spanish : variant or derivative of the personal name Leon.Dutch : from Latin leo ‘lion’, applied either a nickname for a strong or fearless man or a habitational name for someone living at a house distinguished by the sign of a lion; or alternatively from a personal name of the same derivation.German and Hungarian (Leó) : Latinized form of Löwe (see Loewe).
Surname or Lastname
English and Scottish
English and Scottish : nickname from Middle English king, Old English cyning ‘king’ (originally merely a tribal leader, from Old English cyn(n) ‘tribe’, ‘race’ + the Germanic suffix -ing). The word was already used as a byname before the Norman Conquest, and the nickname was common in the Middle Ages, being used to refer to someone who conducted himself in a kingly manner, or one who had played the part of a king in a pageant, or one who had won the title in a tournament. In other cases it may actually have referred to someone who served in the king’s household. The American surname has absorbed several European cognates and equivalents with the same meaning, for example German König (see Koenig), Swiss German Küng, French Leroy. It is also found as an Ashkenazic Jewish surname, of ornamental origin.Chinese : variant of Jin 1.Chinese : , , , , Jing.
Surname or Lastname
English
English : variant spelling of Leach.Irish (Galway) : English name adopted as equivalent of Gaelic Ó Maol Mhaodhóg (see Logue).
Surname or Lastname
English
English : from a medieval personal name, a pet form of Lawrence, formed with the addition of the Middle English suffix -kin (of Low German origin).Irish : reduced Anglicized form of Gaelic Ó Lorcáin ‘descendant of Lorcán’, a personal name from a diminutive of lorc ‘fierce’, ‘cruel’, which was sometimes used as an equivalent to Lawrence.
Surname or Lastname
English
English : habitational name from places in Devon, Oxfordshire, and Wiltshire named Lynam, from Old English lÄ«n ‘flax’ + hÄm ‘homestead’ or hamm ‘enclosure hemmed in by water’.Irish : English surname adopted as an equivalent of Gaelic Ó Laidhghneáin (see Linehan).
Surname or Lastname
English
English : habitational name from a place in Nottinghamshire, named in Old English as ‘homestead at a (district) boundary’, from mearc ‘boundary’ + hÄm ‘homestead’.Irish : English surname used as an equivalent of Gaelic Ó Marcacháin ‘descendant of Marcachán’, a diminutive of Marcach (see Markey). This is a Galway surname, which is sometimes ‘translated’ as Ryder.
Surname or Lastname
English
English : topographic name for someone who lived on the border between two territories, especially in the Marches between England and Wales or England and Scotland, from Anglo-Norman French marche ‘boundary’ (of Germanic origin; compare Mark 2). In some cases, the surname may be a habitational name from March in Cambridgeshire, which was probably named from the locative case of Old English mearc ‘boundary’.English : from a nickname or personal name for someone who was born or baptized in the month of March (Middle English, Old French march(e), Latin Martius (mensis), from the name of the god Mars) or who had some other special connection with the month, such as owing a feudal obligation then.Catalan : from the personal name March, Catalan equivalent of Mark 1.
Surname or Lastname
English and French (Léonard)
English and French (Léonard) : from a Germanic personal name composed of the elements leo ‘lion’ (a late addition to the vocabulary of Germanic name elements, taken from Latin) + hard ‘hardy’, ‘brave’, ‘strong’, which was taken to England by the Normans. A saint of this name, who is supposed to have lived in the 6th century, but about whom nothing is known except for a largely fictional life dating from half a millennium later, was popular throughout Europe in the early Middle Ages and was regarded as the patron of peasants and horses.Irish (Fermanagh) : adopted as an English equivalent of Gaelic Mac Giolla Fhionáin or of Langan.Americanized form of Italian Leonardo or cognate forms in other European languages.The French Léonard family were at Château Richer, Quebec, by 1698, having come from Maine, France.
Surname or Lastname
English
English : from a pet form of the medieval personal name Michel (see Mitchell).Polish : from a short form of any of various personal names such as Michał (Polish equivalent of Michael) or Mikołaj (Polish equivalent of Nicholas).
NP EQUIVALENT
NP EQUIVALENT
Girl/Female
Muslim
Civilized, Urbane, Polished
Surname or Lastname
English
English : variant of Crane.Dutch : variant of Krane.
Girl/Female
Hindu
Blue Sky, Clothed in blue
Boy/Male
Muslim
Candidate. Student.
Girl/Female
Tamil
Sarunati | ஸரà¯à®¨à®¾à®¤à¯€
Nobleminded
Girl/Female
Muslim/Islamic
Dawn
Boy/Male
Hindu, Indian, Marathi
King
Boy/Male
Greek, Indian, Sanskrit
Self Controlled
Boy/Male
Tamil
Srivant | à®·à¯à®°à¯€à®µà®‚த
Lord Vishnu
Boy/Male
Indian, Modern
Brightness
NP EQUIVALENT
NP EQUIVALENT
NP EQUIVALENT
NP EQUIVALENT
NP EQUIVALENT
n.
Credit given; especially, delivery of property or merchandise in reliance upon future payment; exchange without immediate receipt of an equivalent; as, to sell or buy goods on trust.
n.
One who vends; one who transfers the exclusive right of possessing a thing, either his own, or that of another as his agent, for a price or pecuniary equivalent; a seller; a vendor.
n.
A combining unit, whether an atom, a radical, or a molecule; as, in acid salt two or more equivalents of acid unite with one or more equivalents of base.
a.
Of or pertaining to vanadium; obtained from vanadium; -- said of an acid containing one equivalent of vanadium and two of oxygen.
n.
The doctrine of uniformity in the geological history of the earth; -- in part equivalent to uniformitarianism, but also used, more broadly, as opposed to catastrophism.
a.
Capable of neutralizing three molecules of a monacid base, or their equivalent; having three hydrogen atoms capable of replacement by basic elements on radicals; -- said of certain acids; thus, citric acid is a tribasic acid.
a.
Contemporaneous in origin; as, the equivalent strata of different countries.
a.
Capable of neutralizing three molecules of a monobasic acid or the equivalent; having three hydrogen atoms which may be acid radicals; -- said of certain bases; thus, glycerin is a triacid base.
n.
That comparative quantity by weight of an element which possesses the same chemical value as other elements, as determined by actual experiment and reference to the same standard. Specifically: (a) The comparative proportions by which one element replaces another in any particular compound; thus, as zinc replaces hydrogen in hydrochloric acid, their equivalents are 32.5 and 1. (b) The combining proportion by weight of a substance, or the number expressing this proportion, in any particular compound; as, the equivalents of hydrogen and oxygen in water are respectively 1 and 8, and in hydric dioxide 1 and 16.
v. t.
To transfer to another person for a pecuniary equivalent; to make an object of trade; to dispose of by sale; to sell; as, to vend goods; to vend vegetables.
n.
A small coin, and money of account, in England, equivalent to two pennies, -- minted to a fixed annual amount, for almsgiving by the sovereign on Maundy Thursday.
n.
One who translates; esp., one who renders into another language; one who expresses the sense of words in one language by equivalent words in another.
n.
Something equivalent; that which is equal in value, worth, weight, or force; as, to offer an equivalent for damage done.
n.
A word of uncertain signification, used only in the phrase with a wanion, apparently equivalent to with a vengeance, with a plague, or with misfortune.
v. t.
To make the equivalent to; to equal; equivalence.
a.
Equal in measure but not admitting of superposition; -- applied to magnitudes; as, a square may be equivalent to a triangle.
n. pl.
A division of insects nearly equivalent to the true Orthoptera.
a.
Having two hands; -- often used as an epithet equivalent to large, stout, strong, or powerful.
n.
The unit of electro-motive force; -- defined by the International Electrical Congress in 1893 and by United States Statute as, that electro-motive force which steadily applied to a conductor whose resistance is one ohm will produce a current of one ampere. It is practically equivalent to / the electro-motive force of a standard Clark's cell at a temperature of 15¡ C.
n.
Worth estimated by any standard of purchasing power, especially by the market price, or the amount of money agreed upon as an equivalent to the utility and cost of anything.