AI & ChatGPT searches , social queriess for POLLARDS RHO-ALGORITHM
Search references for POLLARDS RHO-ALGORITHM. Phrases containing POLLARDS RHO-ALGORITHM
See searches and references containing POLLARDS RHO-ALGORITHM!
Search references for POLLARDS RHO-ALGORITHM. Phrases containing POLLARDS RHO-ALGORITHM
See searches and references containing POLLARDS RHO-ALGORITHM!POLLARDS RHO-ALGORITHM
Integer factorization algorithm
Pollard's rho algorithm is an algorithm for integer factorization. It was invented by John Pollard in 1975. It uses only a small amount of space, and its
Pollard's_rho_algorithm
Mathematical algorithm
Pollard's rho algorithm for logarithms is an algorithm introduced by John Pollard in 1978 to solve the discrete logarithm problem, analogous to Pollard's
Pollard's rho algorithm for logarithms
Pollard's_rho_algorithm_for_logarithms
Algorithm in computational number theory
problem. The algorithm was introduced in 1978 by the number theorist John M. Pollard, in the same paper as his better-known Pollard's rho algorithm for solving
Pollard's_kangaroo_algorithm
On finding a repeating loop in a sequence
cases where neither of these are possible. The classic example is Pollard's rho algorithm for integer factorization, which searches for a factor p of a given
Cycle_detection
Type of computer science algorithm
algorithms such as Pollard's rho algorithm. Functional programming languages often discourage or do not support explicit in-place algorithms that overwrite
In-place_algorithm
Topics referred to by the same term
Several algorithms created by British mathematician John Pollard: Pollard's kangaroo algorithm Pollard's p − 1 algorithm Pollard's rho algorithm Pollard (coin)
Pollard
Key agreement protocol
requires about O ( p 1 / 2 ) {\displaystyle O(p^{1/2})} time using the Pollards rho algorithm. The most famous example of Montgomery curve is Curve25519 which
Elliptic-curve_Diffie–Hellman
Baby-step giant-step Index calculus algorithm Pohlig–Hellman algorithm Pollard's rho algorithm for logarithms Euclidean algorithm: computes the greatest common
List_of_algorithms
Topics referred to by the same term
ρ, spectral radius of a square matrix Pollard's rho algorithm, for integer factorization Pollard's rho algorithm for logarithms ρ, prime constant ρ, plastic
Rho_(disambiguation)
Decomposition of a number into a product
example, naive trial division is a Category 1 algorithm. Trial division Wheel factorization Pollard's rho algorithm, which has two common flavors to identify
Integer_factorization
Digital signature scheme
parameters, except for the arbitrary choice of base point—for example, Pollard's rho algorithm for logarithms is expected to take approximately ℓ π / 4 {\displaystyle
EdDSA
Quantum search algorithm
efficient algorithm since, for example, the Pollard's rho algorithm is able to find a collision in SHA-2 more efficiently than Grover's algorithm. Grover's
Grover's_algorithm
Algorithm for computing greatest common divisors
essential step in several integer factorization algorithms, such as Pollard's rho algorithm, Shor's algorithm, Dixon's factorization method and the Lenstra
Euclidean_algorithm
Algorithm for solving the discrete logarithm problem
algorithm. Doing so increases the running time, which then is O ( n / m ) {\displaystyle O(n/m)} . Alternatively one can use Pollard's rho algorithm for
Baby-step_giant-step
British mathematician
for the calculation of discrete logarithms. His factorization algorithms include the rho, p − 1, and the first version of the special number field sieve
John_Pollard_(mathematician)
Quantum algorithm for integer factorization
Shor's algorithm is a quantum algorithm for finding the prime factors of an integer. It was developed in 1994 by the American mathematician Peter Shor
Shor's_algorithm
Offset logarithmic integral pH Plethystic logarithm Pollard's kangaroo algorithm Pollard's rho algorithm for logarithms Polylogarithm Polylogarithmic function
Index_of_logarithm_articles
Special-purpose algorithm for factoring integers
Pollard's p − 1 algorithm is a number theoretic integer factorization algorithm, invented by John Pollard in 1974. It is a special-purpose algorithm, meaning
Pollard's_p_−_1_algorithm
Lucas–Lehmer test for Mersenne numbers AKS primality test Pollard's p − 1 algorithm Pollard's rho algorithm Lenstra elliptic curve factorization Quadratic sieve
List_of_number_theory_topics
Problem of inverting exponentiation in groups
calculus algorithm Number field sieve Pohlig–Hellman algorithm Pollard's rho algorithm for logarithms Pollard's kangaroo algorithm (aka Pollard's lambda
Discrete_logarithm
Number divisible only by 1 and itself
factorization algorithms are known, they are slower than the fastest primality testing methods. Trial division and Pollard's rho algorithm can be used to
Prime_number
Graph with at most one cycle per component
applications in cryptography and computational number theory, as part of Pollard's rho algorithm for integer factorization and as a method for finding collisions
Pseudoforest
John Pollard 1974 – Quadtree developed by Raphael Finkel and J.L. Bentley 1975 – Genetic algorithms popularized by John Holland 1975 – Pollard's rho algorithm
Timeline_of_algorithms
Type of cryptographic attack
contract, not just the fraudulent one. Pollard's rho algorithm for logarithms is an example for an algorithm using a birthday attack for the computation
Birthday_attack
Best results achieved to date
about 1300 people represented by Robert Harley. They used a parallelized Pollard rho method with speedup. ECC2-109, involving taking a discrete logarithm
Discrete_logarithm_records
Australian mathematician and computer scientist
than 1015000). In 1980 he and John Pollard factored the eighth Fermat number using a variant of the Pollard rho algorithm. He later factored the tenth and
Richard_P._Brent
Algorithm to multiply two numbers
multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are more efficient
Multiplication_algorithm
Largest integer that divides given integers
|a|. This case is important as the terminating step of the Euclidean algorithm. The above definition is unsuitable for defining gcd(0, 0), since there
Greatest_common_divisor
Algorithm for integer multiplication
The Karatsuba algorithm is a fast multiplication algorithm for integers. It was discovered by Anatoly Karatsuba in 1960 and published in 1962. It is a
Karatsuba_algorithm
Attribute of machine learning models
{\displaystyle N(\rho ,\epsilon ,\delta )=\infty } . If there exists an algorithm for which N ( ρ , ϵ , δ ) {\displaystyle N(\rho ,\epsilon ,\delta )}
Sample_complexity
Schoof's algorithm Elliptic curve cryptography Baby-step giant-step Public key cryptography Schoof–Elkies–Atkin algorithm Pollard rho Pollard kangaroo
Counting points on elliptic curves
Counting_points_on_elliptic_curves
Method for computing the relation of two integers with their greatest common divisor
and computer programming, the extended Euclidean algorithm is an extension to the Euclidean algorithm, and computes, in addition to the greatest common
Extended_Euclidean_algorithm
Probabilistic algorithm for computing discrete logarithms
In computational number theory, the index calculus algorithm is a probabilistic algorithm for computing discrete logarithms. Dedicated to the discrete
Index_calculus_algorithm
currently best known discrete logarithm attack is the generic Pollard's rho algorithm, requiring about 2 122.5 {\displaystyle 2^{122.5}} group operations
FourQ
Integer factorization algorithm
to Pollard's p − 1 algorithm. In fact, it is also able to find p if p − 1 is smooth, in which case it degenerates into a slow version of Pollard's algorithm
Williams's_p_+_1_algorithm
Ancient algorithm for generating prime numbers
In mathematics, the sieve of Eratosthenes is an ancient algorithm for finding all prime numbers up to any given limit. It does so by iteratively marking
Sieve_of_Eratosthenes
Algorithm checking for prime numbers
test and the cyclotomic AKS test) is a deterministic primality-proving algorithm created and published by Manindra Agrawal, Neeraj Kayal, and Nitin Saxena
AKS_primality_test
Algorithm in computational number theory
Lenstra–Lenstra–Lovász (LLL) lattice basis reduction algorithm is a polynomial time lattice reduction algorithm invented by Arjen Lenstra, Hendrik Lenstra and
Lenstra–Lenstra–Lovász lattice basis reduction algorithm
Lenstra–Lenstra–Lovász_lattice_basis_reduction_algorithm
Multiplication algorithm
The Schönhage–Strassen algorithm is an asymptotically fast multiplication algorithm for large integers, published by Arnold Schönhage and Volker Strassen
Schönhage–Strassen_algorithm
System of rapid mental calculation
This article presents some methods devised by Trachtenberg. Some of the algorithms Trachtenberg developed are for general multiplication, division and addition
Trachtenberg_system
In computational number theory, Cipolla's algorithm is a technique for solving a congruence of the form x 2 ≡ n ( mod p ) , {\displaystyle x^{2}\equiv
Cipolla's_algorithm
Method for division with remainder
A division algorithm is an algorithm which, given two integers N and D (respectively the numerator and the denominator), computes their quotient and/or
Division_algorithm
Probabilistic primality test
or Rabin–Miller primality test is a probabilistic primality test: an algorithm which determines whether a given number is likely to be prime, similar
Miller–Rabin_primality_test
Fast greatest common divisor algorithm
GCD algorithm, named after D. H. Lehmer, is a fast GCD algorithm for multiple-precision arithmetic, which improves on the simpler Euclidean algorithm by
Lehmer's_GCD_algorithm
Algorithm used in modular arithmetic
The Tonelli–Shanks algorithm (referred to by Shanks as the RESSOL algorithm) is used in modular arithmetic to solve for r in a congruence of the form r2
Tonelli–Shanks_algorithm
Integer factorization algorithm
N} is large. For a number as small as 15347, this algorithm is overkill. Trial division or Pollard rho could have found a factor with much less computation
Quadratic_sieve
American computer scientist
run-time of the Pollard rho method where previous work relied on heuristic estimates and empirical data. He is the namesake of Bach's algorithm for generating
Eric_Bach
Multiplication algorithm
ancient Egypt the concept of base 2 did not exist, the algorithm is essentially the same algorithm as long multiplication after the multiplier and multiplicand
Ancient Egyptian multiplication
Ancient_Egyptian_multiplication
Method in number theory
In number theory, Berlekamp's root finding algorithm, also called the Berlekamp–Rabin algorithm, is the probabilistic method of finding roots of polynomials
Berlekamp–Rabin_algorithm
Special-purpose integer factorization algorithm
number field sieve (SNFS) is a special-purpose integer factorization algorithm. The general number field sieve (GNFS) was derived from it. The special
Special_number_field_sieve
Algorithm for computing the greatest common divisor
The binary GCD algorithm, also known as Stein's algorithm or the binary Euclidean algorithm, is an algorithm that computes the greatest common divisor
Binary_GCD_algorithm
Integer having only small prime factors
n-powersmooth numbers have applications in number theory, such as in Pollard's p − 1 algorithm and ECM. Such applications are often said to work with "smooth
Smooth_number
Standard division algorithm for multi-digit numbers
In arithmetic, long division is a standard division algorithm suitable for dividing multi-digit numbers that is simple enough to perform by hand. It breaks
Long_division
Algorithm for generating prime numbers
Sundaram is a variant of the sieve of Eratosthenes, a simple deterministic algorithm for finding all the prime numbers up to a specified integer. It was discovered
Sieve_of_Sundaram
Algorithm for checking if a number is prime
exponentiation algorithm like binary or addition-chain exponentiation). The algorithm can be written in pseudocode as follows: algorithm lucas_primality_test
Lucas_primality_test
Algorithm for integer factorization
elliptic-curve factorization method (ECM) is a fast, sub-exponential running time, algorithm for integer factorization, which employs elliptic curves. For general-purpose
Lenstra elliptic-curve factorization
Lenstra_elliptic-curve_factorization
Pocklington's algorithm is a technique for solving a congruence of the form x 2 ≡ a ( mod p ) , {\displaystyle x^{2}\equiv a{\pmod {p}},} where x and
Pocklington's_algorithm
Mathematical procedure
a_{1}x_{1}+a_{2}x_{2}+\cdots +a_{n}x_{n}=0.\,} An integer relation algorithm is an algorithm for finding integer relations. Specifically, given a set of real
Integer_relation_algorithm
Greatest integer less than or equal to square root
y {\displaystyle y} and k {\displaystyle k} be non-negative integers. Algorithms that compute (the decimal representation of) y {\displaystyle {\sqrt {y}}}
Integer_square_root
Algorithm for computing logarithms
theory, the Pohlig–Hellman algorithm, sometimes credited as the Silver–Pohlig–Hellman algorithm, is a special-purpose algorithm for computing discrete logarithms
Pohlig–Hellman_algorithm
Efficient algorithm to count points on elliptic curves
Schoof's algorithm is an efficient algorithm to count points on elliptic curves over finite fields. The algorithm has applications in elliptic curve cryptography
Schoof's_algorithm
Approach to public-key cryptography
_{q}} . Because all the fastest known algorithms that allow one to solve the ECDLP (baby-step giant-step, Pollard's rho, etc.), need O ( n ) {\displaystyle
Elliptic-curve_cryptography
Factorization algorithm
the general number field sieve (GNFS) is the most efficient classical algorithm known for factoring integers larger than 10100. Heuristically, its complexity
General_number_field_sieve
Exponentation in modular arithmetic
multiplicative inverse d of b modulo m (for instance by using extended Euclidean algorithm). More precisely: c = be mod m = d−e mod m, where e < 0 and b ⋅ d ≡ 1
Modular_exponentiation
Probabilistic primality test
no value. Using fast algorithms for modular exponentiation and multiprecision multiplication, the running time of this algorithm is O(k log2n log log
Fermat_primality_test
Primality test for certain numbers
based on the Lucas–Lehmer primality test. It is the fastest deterministic algorithm known for numbers of that form.[citation needed] For numbers of the form
Lucas–Lehmer–Riesel_test
Algorithm for generating prime numbers
In mathematics, the sieve of Atkin is a modern algorithm for finding all prime numbers up to a specified integer. Compared with the ancient sieve of Eratosthenes
Sieve_of_Atkin
Integer factorization algorithm
In mathematics, the rational sieve is a general algorithm for factoring integers into prime factors. It is a special case of the general number field
Rational_sieve
Methods to test or prove primality
Goldwasser and Joe Kilian in 1986 and turned into an algorithm by A. O. L. Atkin in the same year. The algorithm was altered and improved by several collaborators
Elliptic_curve_primality
Algorithms to generate prime numbers
In computational number theory, a variety of algorithms make it possible to generate prime numbers efficiently. These are used in various applications
Generation_of_primes
Number-theoretic algorithm
In computational number theory, Cornacchia's algorithm is an algorithm for solving the Diophantine equation x 2 + d y 2 = m {\displaystyle x^{2}+dy^{2}=m}
Cornacchia's_algorithm
converse is not necessarily true. Grantham's stated goal when developing the algorithm was to provide a test that primes would always pass and composites would
Quadratic_Frobenius_test
Algorithm for determining whether a number is prime
Adleman–Pomerance–Rumely primality test is an algorithm for determining whether a number is prime. Unlike other, more efficient algorithms for this purpose, it avoids the
Adleman–Pomerance–Rumely primality test
Adleman–Pomerance–Rumely_primality_test
Probabilistic primality test
composite return probably prime Using fast algorithms for modular exponentiation, the running time of this algorithm is O(k·log3 n), where k is the number
Solovay–Strassen primality test
Solovay–Strassen_primality_test
Integer factorization algorithm
most laborious but easiest to understand of the integer factorization algorithms. The essential idea behind trial division tests to see if an integer n
Trial_division
Korkine–Zolotarev (KZ) lattice basis reduction algorithm or Hermite–Korkine–Zolotarev (HKZ) algorithm is a lattice reduction algorithm. For lattices in R n {\displaystyle
Korkine–Zolotarev lattice basis reduction algorithm
Korkine–Zolotarev_lattice_basis_reduction_algorithm
Algorithm to solve the discrete logarithm problem
In mathematics, the Function Field Sieve is one of the most efficient algorithms to solve the Discrete Logarithm Problem (DLP) in a finite field. It has
Function_field_sieve
Algorithm for multiplying large numbers
introduced the new algorithm with its low complexity, and Stephen Cook, who cleaned the description of it, is a multiplication algorithm for large integers
Toom–Cook_multiplication
Test if a Mersenne number is prime
odd prime. The primality of p can be efficiently checked with a simple algorithm like trial division since p is exponentially smaller than Mp. Define a
Lucas–Lehmer_primality_test
Algorithm in number theory
(also Dixon's random squares method or Dixon's algorithm) is a general-purpose integer factorization algorithm; it is the prototypical factor base method
Dixon's_factorization_method
problem in finite abelian groups such as the Pohlig–Hellman algorithm and Pollard's rho method can be used to attack the DLP in the Jacobian of hyperelliptic
Hyperelliptic curve cryptography
Hyperelliptic_curve_cryptography
Integer factorization algorithm
x-y} will give a non-trivial factor of N {\displaystyle N} . A practical algorithm for finding pairs ( x , y ) {\displaystyle (x,y)} which satisfy x 2 ≡
Shanks's square forms factorization
Shanks's_square_forms_factorization
Unique point where the weighted relative position of the distributed mass sums to zero
{1}{M}}\int \rho (\mathbf {r} )\mathbf {r} \,dV,} where M {\displaystyle M} is the total mass in the volume and ρ ( r ) {\displaystyle \rho (\mathbf {r}
Center_of_mass
Algorithm for generating numbers coprime with first few primes
list of initial prime numbers constitute complete parameters for the algorithm to generate the remainder of the list. These generators are referred to
Wheel_factorization
Probabilistic primality testing algorithm
primality test is a probabilistic or possibly deterministic primality testing algorithm that determines whether a number is composite or is a probable prime.
Baillie–PSW_primality_test
Algorithm for generating prime numbers
In mathematics, the sieve of Pritchard is an algorithm for finding all prime numbers up to a specified bound. Like the ancient sieve of Eratosthenes,
Sieve_of_Pritchard
Cyclic algorithm to solve indeterminate quadratic equations
The chakravala method (Sanskrit: चक्रवाल विधि) is a cyclic algorithm to solve indeterminate quadratic equations, including Pell's equation. It is commonly
Chakravala_method
Mathematical for factoring integers
made Euler's factorization method disfavoured for computer factoring algorithms, since any user attempting to factor a random integer is unlikely to know
Euler's_factorization_method
Study of algorithms for performing number theoretic computations
mathematics and computer science, computational number theory, also known as algorithmic number theory, is the study of computational methods for investigating
Computational_number_theory
factorization method (CFRAC) is an integer factorization algorithm. It is a general-purpose algorithm, meaning that it is suitable for factoring any integer
Continued fraction factorization
Continued_fraction_factorization
Mathematical lemma
Newton-Raphson Long Short SRT Discrete logarithm Baby-step giant-step Pollard rho Pollard kangaroo Pohlig–Hellman Index calculus Function field sieve Greatest
Bhaskara's_lemma
Factorization method based on the difference of two squares
of the quadratic sieve and general number field sieve, the best-known algorithms for factoring large semiprimes, which are the "worst-case". The primary
Fermat's_factorization_method
Primality test for Fermat numbers
F_{n}} by repeated squaring. This makes the test a fast polynomial-time algorithm. However, Fermat numbers grow so rapidly that only a handful of Fermat
Pépin's_test
Primality test for numbers of a certain form
in contrast to the probably prime results typical of other Monte Carlo algorithms such as the Miller-Rabin test. An approximate upper bound error probability
Proth's_theorem
In cryptography, XTR is an algorithm for public-key encryption. XTR stands for 'ECSTR', which is an abbreviation for Efficient and Compact Subgroup Trace
XTR
Volunteer computing project aimed at finding a MD5 collision
CertainKey Cryptosystems, to demonstrate that the MD5 message digest algorithm is insecure by finding a collision – two messages that produce the same
MD5CRK
Number theory library written in C
BPSW, etc.) Integer factorization (trial factor, quadratic sieve, Pollard's rho, Lenstra ECM) Multivariate polynomial GCD and factorisation FFTs Multimodular
Fast Library for Number Theory
Fast_Library_for_Number_Theory
Number-theoretic algorithm
Newton-Raphson Long Short SRT Discrete logarithm Baby-step giant-step Pollard rho Pollard kangaroo Pohlig–Hellman Index calculus Function field sieve Greatest
Pocklington_primality_test
Central nervous system stimulant
by amphetamine, this pathway activates Ras homolog A (RhoA) and its downstream protein kinase, Rho-associated coiled-coil kinase (ROCK), an effect that
Amphetamine
Theorem in physics
{\vec {b}})=\int d\lambda \,\rho (\lambda )A({\vec {a}},\lambda )B({\vec {b}},\lambda ),} where ρ ( λ ) {\displaystyle \rho (\lambda )} is a probability
Bell's_theorem
POLLARDS RHO-ALGORITHM
POLLARDS RHO-ALGORITHM
Surname or Lastname
English
English : nickname from Middle English dull + -ard ‘dull or stupid person’. Compare Doll 5.Irish : either an importation to Ireland of the English name or, possibly, a reduced and altered form of de la Hyde (see Dollarhide).
Surname or Lastname
English and Irish
English and Irish : according to MacLysaght, this is a surname of Dutch origin which was taken to Ireland early in the 18th century.French : from a personal name composed of the Germanic elements boll ‘friend’, ‘brother’ + hard ‘hardy’, ‘strong’.
Girl/Female
Spanish
River.
Male
Portuguese
Portuguese form of Latin Desiderius, DESIDÉRIO means "longing."Â
Female
Japanese
(1-亮, 2-é¼, 3-è«’, 4-涼) Japanese unisex name RYO means 1) "brightness," 2) "distant," 3) "reality," 4) "refreshing."
Male
Portuguese
Portuguese form of Latin Marius, MÃRIO means "male, virile."
Girl/Female
Gujarati, Hindu, Indian
Soul
Surname or Lastname
English
English : variant of Holland 1.Dutch : variant of Holland 2.Dutch : habitational name from places called Holland in northern France, named with Middle Dutch onland(e) ‘marsh’.
Surname or Lastname
English
English : variant of Wolford.
Surname or Lastname
English (Devon)
English (Devon) : variant spelling of Roe.Korean : variant of No.
Female
Japanese
Variant spelling of Japanese Chou, CHO means "butterfly."
Surname or Lastname
English
English : nickname for a person with a large or unusually shaped head, from Middle English poll ‘head’ (Middle Low German polle ‘(top of the) head’) + the pejorative suffix -ard. The term pollard in the sense denoting an animal that has had its horns lopped is not recorded before the 16th century, and as applied to a tree the word is not recorded until the 17th century; so both these senses are almost certainly too late to have contributed to the surname.English : pejorative derivative of the personal name Paul. The surname has been established in Ireland since the 14th century.
Male
Finnish
Finnish name URHO means "brave."
Boy/Male
British, English
Shorn Head
Boy/Male
British, English
Shorn Head
Boy/Male
Spanish
River. Abbreviation of names ending with '-rio.
Surname or Lastname
English (Gloucestershire)
English (Gloucestershire) : from Middle English soler ‘solar’, ‘upper floor of a house’ (Old English solor), probably an occupational name for a servant whose duties were centered in the upper part of a house.
Male
Japanese
(ç¿”) Japanese name SHO means "to fly, to soar" or "wind instrument."
Surname or Lastname
English and French
English and French : from the personal name Coll + the pejorative suffix -ard.
Boy/Male
British, English, Teutonic
Short Haired
POLLARDS RHO-ALGORITHM
POLLARDS RHO-ALGORITHM
Boy/Male
Afghan, Arabic, Australian, Muslim
Accounter; Omnipotent; Another Name of Allah
Boy/Male
English
Noted splendor.
Girl/Female
Indian
Garden, Famous, Godly
Girl/Female
Indian
Happy, Precious, Generous
Girl/Female
Australian, Danish, French, Greek, Latin
Daughter of the Sun
Biblical
same as Noah
Boy/Male
Muslim
Peace. Peaceful. Very safe.
Girl/Female
Indian, Telugu
Brilliant
Boy/Male
Tamil
Sandipan | ஸாஂதீபந
A sage, Lighting
Boy/Male
Scandinavian
God is the protector.
POLLARDS RHO-ALGORITHM
POLLARDS RHO-ALGORITHM
POLLARDS RHO-ALGORITHM
POLLARDS RHO-ALGORITHM
POLLARDS RHO-ALGORITHM
n.
The doctrines or principles of the Lollards.
p. pr. & vb. n.
of Pollard
pron.
Who.
n.
A tree having its top cut off at some height above the ground, that may throw out branches.
n.
Alt. of Lollardy
a.
Supported or ornamented by pillars; resembling a pillar, or pillars.
n.
A stag that has cast its antlers.
n.
The European chub. See Pollard, 3 (a).
n.
See Holland.
n.
A Lollard.
n. pl.
Young cabbage, used as "greens"; esp. a kind cultivated for that purpose; colewort.
n.
Gin made in Holland.
object.
Originally, an interrogative pronoun, later, a relative pronoun also; -- used always substantively, and either as singular or plural. See the Note under What, pron., 1. As interrogative pronouns, who and whom ask the question: What or which person or persons? Who and whom, as relative pronouns (in the sense of that), are properly used of persons (corresponding to which, as applied to things), but are sometimes, less properly and now rarely, used of animals, plants, etc. Who and whom, as compound relatives, are also used especially of persons, meaning the person that; the persons that; the one that; whosoever.
imp. & p. p.
of Pollard
n.
A bollard timber. See under Bollard.
n.
A clipped coin; also, a counterfeit.
n.
A buffoon. See Gollard.
n.
A hornless animal (cow or sheep).
v. t.
To lop the tops of, as trees; to poll; as, to pollard willows.
n.
A fish, the chub.