AI & ChatGPT searches , social queries for HIDDEN MATCHING-PROBLEM
Search references for HIDDEN MATCHING-PROBLEM. Phrases containing HIDDEN MATCHING-PROBLEM
See searches and references containing HIDDEN MATCHING-PROBLEM!
Search references for HIDDEN MATCHING-PROBLEM. Phrases containing HIDDEN MATCHING-PROBLEM
See searches and references containing HIDDEN MATCHING-PROBLEM!HIDDEN MATCHING-PROBLEM
Computation complexity problem
In quantum information, the hidden matching problem is a computational complexity problem that can be solved using quantum protocols: Let n {\displaystyle
Hidden_matching_problem
Matching of coordinates to physical locations
Map matching is the problem of how to match recorded geographic coordinates to a logical model of the real world, typically using some form of Geographic
Map_matching
Very general problem in computer science
The hidden subgroup problem (HSP) is a topic of research in mathematics and theoretical computer science. It is a generalization of problems including
Hidden_subgroup_problem
Unsolved problem in computational complexity theory
group. In the area of image recognition it is known as the exact graph matching problem. In November 2015, László Babai announced a quasi-polynomial time algorithm
Graph_isomorphism_problem
Proposed design of bank notes
can currently store quantum states only for a very short time. Hidden Matching Problem Wiesner, Stephen (1983-01-01). "Conjugate Coding". SIGACT News
Quantum_money
Statistical matching technique
statistical analysis of observational data, propensity score matching (PSM) is a statistical matching technique that attempts to estimate the effect of a treatment
Propensity_score_matching
Video game genre
items from a list that are hidden within a scene. Hidden object games are a popular trend in casual gaming. In tile-matching video games, the player manipulates
Puzzle_video_game
Problem in computer science
Simon's problem, usually called Simon's algorithm, served as the inspiration for Shor's algorithm. Both problems are special cases of the abelian hidden subgroup
Simon's_problem
Search problem in quantum mechanics
The hidden linear function problem, is a search problem that generalizes the Bernstein–Vazirani problem. In the Bernstein–Vazirani problem, the hidden function
Hidden linear function problem
Hidden_linear_function_problem
Technique in digital image processing
The main challenges in a template matching task are detection of occlusion, when a sought-after object is partly hidden in an image; detection of non-rigid
Template_matching
Classical problem in combinatorics
ISBN 1-58113-349-9 Wikimedia Commons has media related to Set cover problem. Benchmarks with Hidden Optimum Solutions for Set Covering, Set Packing and Winner
Set_cover_problem
Problem in computer science
k elements. When k=1, the problem is trivial. When k=2, the problem is equivalent to finding a maximum cardinality matching, which can be solved in polynomial
Set_packing
Quantum search algorithm
an Indian-American computer scientist Lov Grover in 1996. The analogous problem in classical computation would have a query complexity O ( N ) {\displaystyle
Grover's_algorithm
Task of finding records in a data set that refer to same entity across different sources
communities. Computer scientists often refer to it as "data matching" or as the "object identity problem".[citation needed] Commercial mail and database applications
Record_linkage
function value iterations Gale–Shapley algorithm: solves the stable matching problem Pseudorandom number generators (uniformly distributed—see also List
List_of_algorithms
Tile-matching video games are a type of puzzle video game where the player manipulates tiles in order to make them disappear according to a matching criterion
List_of_puzzle_video_games
Optimization algorithms using quantum computing
set of possible solutions. Mostly, the optimization problem is formulated as a minimization problem, where one tries to minimize an error which depends
Quantum optimization algorithms
Quantum_optimization_algorithms
graphics) Happy ending problem Ham sandwich problem shape assembly problems shape matching problems Klee's measure problem Problems on isothetic polygons
List of combinatorial computational geometry topics
List_of_combinatorial_computational_geometry_topics
Quantum algorithm for integer factorization
the period-finding algorithm, and all three are instances of the hidden subgroup problem. On a quantum computer, to factor an integer N {\displaystyle N}
Shor's_algorithm
Task of computing complete subgraphs
O(3n/3), matching the number of cliques that might need to be listed. Therefore, this provides a worst-case-optimal solution to the problem of listing
Clique_problem
considered objections to the existence of God like the problem of evil and divine hiddenness. What is God like? Philosophers like John Stuart Mill and
List of philosophical problems
List_of_philosophical_problems
Computational complexity class of problems
at certain roots of unity Harrow-Hassidim-Lloyd (HHL) algorithm Hidden subgroup problem Polynomial hierarchy (PH) Quantum complexity theory QMA, the quantum
BQP
Algorithm to be run on quantum computers
quantum algorithms known for the Abelian hidden subgroup problem. The more general hidden subgroup problem, where the group is not necessarily abelian
Quantum_algorithm
Theorem in physics
University Press. ISBN 978-0-19-874299-9. Bell, J. S. (1966). "On the problem of hidden variables in quantum mechanics". Reviews of Modern Physics. 38 (3):
Bell's_theorem
Quantum Merlin Arthur
known problems are discussed below. A problem is said to be QMA-hard, analogous to NP-hard, if every problem in QMA can be reduced to it. A problem is said
QMA
Process of linking data objects in distinct models
data lineage analysis Discovery of hidden sensitive data such as the last four digits of a social security number hidden in another user id as part of a
Data_mapping
Mathematical game of resource allocation
CY]. Martin, Layla (2017). "Extending Kolkata Paise Restaurant problem to dynamic matching in mobility markets". Junior Manag. Sci. 4: 1–34. doi:10.5282/jums/v4i1pp1-34
Kolkata Paise Restaurant Problem
Kolkata_Paise_Restaurant_Problem
Computer science professor
known for his contributions in Runtime Verification, the K framework, matching logic, automated coinduction., and for founding Runtime Verification, Inc
Grigore_Roșu
Change of basis applied in quantum computing
the eigenvalues of a unitary operator, and algorithms for the hidden subgroup problem. The quantum Fourier transform was discovered by Don Coppersmith
Quantum_Fourier_transform
Macros whose expansion is guaranteed not to cause the capture of identifiers
existing variable bindings to be hidden from a macro by variable bindings that are created during its expansion. In C, this problem can be illustrated by the
Hygienic_macro
Automated recognition of patterns and regularities in data
perform "most likely" matching of the inputs, taking into account their statistical variation. This is opposed to pattern matching algorithms, which look
Pattern_recognition
Applied science involving study of crime
consider less likely to commit the crimes or give the tracking or individual matching to the evidence lower priority. According to the hypotheses [clarification
Criminal_investigation
Computational benchmark
computer can solve a problem that no classical computer can solve in any feasible amount of time, irrespective of the usefulness of the problem. The term was
Quantum_supremacy
Mathematical problem
gallery problem or museum problem is a well-studied visibility problem in computational geometry. It originates from the following real-world problem: "In
Art_gallery_problem
Quantum algorithm
quantum computing software development framework by IBM. Hidden Linear Function problem Simon's problem Ethan Bernstein and Umesh Vazirani (1997). "Quantum
Bernstein–Vazirani_algorithm
Model of computation
deterministic quantum computation with one clean qubit is the class of decision problems solvable by a one clean qubit machine in polynomial time, upon measuring
One_clean_qubit
Visual illusion of 3D scene
pixel in the image is computed from a pattern strip and a depth map. A hidden 3D scene emerges when the image is viewed with the correct vergence. Unlike
Autostereogram
Quantum Mechanics in Neural Networks
equivalent for the perceptron unit from which neural nets are constructed. A problem is that nonlinear activation functions do not immediately correspond to
Quantum_neural_network
Property of computational resources needed
doi:10.1038/s41534-022-00551-1. ISSN 2056-6387. "Colliding top quarks reveal hidden quantum magic". Queen Mary University of London. December 19, 2024. "Scientists
Magic_(quantum_information)
Forecasting rules for quantum computing
(2019-10-24). "Google quantum breakthrough will help solve 'impossible problems'". Financial Times. Retrieved 2025-09-02.{{cite web}}: CS1 maint: deprecated
Quantum computing scaling laws
Quantum_computing_scaling_laws
Deterministic quantum algorithm
computer. Simon's problem is an example of a problem that yields an oracle separation between BQP and BPP. In the Deutsch–Jozsa problem, we are given a
Deutsch–Jozsa_algorithm
Overview of and topical guide to algorithms
Maximum flow problem Ford–Fulkerson algorithm Edmonds–Karp algorithm Push–relabel maximum flow algorithm Minimum-cost flow problem Bipartite matching Hopcroft–Karp
Outline_of_algorithms
Restricted model of non-universal quantum computation
of identical bosons scattered by a linear interferometer. Although the problem is well defined for any bosonic particles, its photonic version is currently
Boson_sampling
2005 European film
Caché (French: [kaʃe]), also known as Hidden, is a 2005 neo-noir psychological thriller film written and directed by Michael Haneke and starring Daniel
Caché_(film)
Hypothetical invisible cosmic material
problems". Bulletin of the Astronomical Institutes of the Netherlands. 6: 249–287. Bibcode:1932BAN.....6..249O. "The hidden lives of galaxies: Hidden
Dark_matter
Theorem in quantum mechanics
1007/s00023-018-0729-8. S2CID 53630146. Bell, John (1966). "On the Problem of Hidden Variables in Quantum Mechanics". Reviews of Modern Physics. 38 (3):
Gleason's_theorem
Quantum algorithm for counting solutions to search problems
given search problem. The algorithm is based on the quantum phase estimation algorithm and on Grover's search algorithm. Counting problems are common in
Quantum_counting_algorithm
Interpretation of quantum mechanics
state of knowledge, and it is not knowledge of local and noncontextual hidden variables, then what is it knowledge about? We do not at present have a
QBism
Computer hardware technology that uses quantum mechanics
solving the dihedral hidden subgroup problem, which would break many lattice-based cryptosystems, is a well-studied open problem. It has been shown that
Quantum_computing
Overview of and topical guide to machine learning
neighbor Boosting SPRINT Bayesian networks Naive Bayes Hidden Markov models Hierarchical hidden Markov model Bayesian statistics Bayesian knowledge base
Outline_of_machine_learning
Quantum-mechanical version of computer memory
is so low in energy as to be lost in a complex light background. These problems have long kept quantum storage rates below 50%. A team led by professor
Quantum_memory
Protocol in quantum cryptography
as weak coherent state laser source, are widely used for QKD. The key problem with these practical QKD sources lies on their multi-photon components
Decoy_state
Problem or enigma that tests a person's ingenuity
centered on a word puzzle. Puzzle video games Tile-matching video game Puzzle-platformer Adventure game Hidden object game Minesweeper Solutions of puzzles
Puzzle
Quantum algorithm
(BHT) algorithm is a quantum algorithm that solves the collision problem. In this problem, one is given n and an 2-to-1 function f : { 1 , … , n } → { 1
BHT_algorithm
Single-player game played with mahjong tiles
, assuming that there are arbitrarily many quadruples of matching tiles and that the hidden tiles are uniformly distributed. The perfect-information version
Mahjong_solitaire
Quantum algorithm
algorithm. One of the first works on the application of quantum walk to search problems was proposed by Neil Shenvi, Julia Kempe, and K. Birgitta Whaley. Given
Quantum_walk_search
Computational complexity of quantum algorithms
model based on quantum mechanics. It studies the hardness of computational problems in relation to these complexity classes, as well as the relationship between
Quantum_complexity_theory
Predictive mean matching (PMM) is a widely used statistical imputation method for missing values, first proposed by Donald B. Rubin in 1986 and R. J. A
Predictive_mean_matching
Simulators of quantum mechanical systems
special purpose devices designed to provide insight about specific physics problems. Quantum simulators may be contrasted with generally programmable "digital"
Quantum_simulator
Applications of machine learning to quantum physics
turn large and noisy data sets into meaningful information. This is a problem that has already been studied extensively in the classical setting, and
Machine_learning_in_physics
Cryptography secured against quantum computers
problems: the integer factorization problem, the discrete logarithm problem, or the elliptic-curve discrete logarithm problem. All of these problems could
Post-quantum_cryptography
Person influential on social media
influencer selection extends into product personality. This product and benefit matching is key. For a shampoo, it should use an influencer with good hair. Likewise
Influencer
Quantum-informatics technique
expressible analytical formula. More precisely, in its standard formulation, the problem involves performing some POVM ( E i ) i {\displaystyle (E_{i})_{i}} on
Quantum_state_discrimination
Quantum computing protocol
classical machine learning algorithms for a wide range of quantum many-body problems. For example, machine learning models could learn to solve ground states
Classical_shadow
into letters by the very act of writing them on the page. Given templates matching typical letter shapes in a given language, individual letters can be identified
Sayre's_paradox
Form of quantum computing
description of a computer based on the laws of quantum physics. He solved the problem of a time-independent and local Hamiltonian by proposing a continuous-time
Hamiltonian quantum computation
Hamiltonian_quantum_computation
Estimate of time taken for running an algorithm
(2005). "A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem". SIAM Journal on Computing. 35 (1). Philadelphia: 188. arXiv:quant-ph/0302112
Time_complexity
Algorithm for measuring similarity between temporal sequences
and online signature recognition. It can also be used in partial shape matching applications. In general, DTW is a method that calculates an optimal match
Dynamic_time_warping
Complexity class
computing analogue of the classical complexity class IP, which is the set of problems solvable by an interactive proof system with a polynomial-time verifier
QIP_(complexity)
broad groups: Draw poker: Games in which players are dealt a complete hand, hidden, and then improve it by replacing cards. The most common of these is five-card
List_of_poker_variants
Proposed quantum computer implementation
α from the interaction with the magnetic field is path-dependent, the problem is highly complex. Considering the multiple ways that decoherence of a
Trapped-ion_quantum_computer
Study with uncontrolled variable of interest
well as to assess the influence of potential hidden biases. The following are a non-exhaustive set of problems especially common in observational studies
Observational_study
Metric for a quantum computer's capabilities
indicates a faster and more accurate device capable of solving more complex problems. Microsoft suggest that a machine with 1 million rQOPS qualifies as a quantum
RQOPS
Chordal graph) Perfect order Hidden Markov model Baum–Welch algorithm Viterbi algorithm Incidence matrix Independent set problem Knowledge representation
List_of_graph_theory_topics
Topological quantum error correcting code
to achieve them. The most well-used algorithm is minimum weight perfect matching. When applied to the noise model with independent bit and flip errors,
Surface_code
Quantum error correction schemes can suppress the logical error rate arbitrarily low
classical computers to simulate quantum systems. This problem is known as the quantum many body problem. However, quantum computers can simulate many (though
Threshold_theorem
Criteria for a usable quantum computer
efficiently simulate quantum systems, such as in solving the quantum many-body problem. There have been many proposals for how to construct a quantum computer
DiVincenzo's_criteria
Experimental technology level
demonstrated QAOA's potential for quantum advantage on specific problem classes. For the Max Cut problem on random graphs, QAOA at depth p=11 has been shown to
Noisy intermediate-scale quantum computing
Noisy_intermediate-scale_quantum_computing
Type of quantum information processing
Hamiltonian is found whose ground state describes the solution to the problem of interest. Next, a system with a simple Hamiltonian is prepared and initialized
Adiabatic_quantum_computation
Quantum algorithm for eigenvalue estimation
A. Yu (1995-11-20). "Quantum measurements and the Abelian Stabilizer Problem". arXiv:quant-ph/9511026. Nielsen, Michael A. & Isaac L. Chuang (2001)
Quantum phase estimation algorithm
Quantum_phase_estimation_algorithm
Purely statistical model of language
involving out-of-vocabulary words. n-grams were also used for approximate matching. If we convert strings (with only letters in the English alphabet) into
Word_n-gram_language_model
Networks connecting quantum processors
transporting quantum data from flying and stable qubits via infrared spectrum matching. This requires a sophisticated, super-cooled yttrium silicate crystal to
Quantum_network
Remote quantum processors for computation
M.; Buyya, R. (April 2024). "Quantum Cloud Computing: A Review, Open Problems, and Future Directions". arXiv:2404.11420 [cs.ET]. Chen, Xi; Cheng, Bin;
Cloud-based_quantum_computing
Classical quantization technique from signal processing
chooses a set of points to represent a larger set of points. The density matching property of vector quantization is powerful, especially for identifying
Vector_quantization
Technique for the generative modeling of a continuous probability distribution
noise conditional score network (NCSN) or score-matching with Langevin dynamics (SMLD). Consider the problem of image generation. Let x {\displaystyle x}
Diffusion_model
Field of machine learning
distribution of observed trajectories subject to constraints related to matching expected feature counts. Recently it has been shown that MaxEnt IRL is
Reinforcement_learning
Data analysis techniques for fraud detection
rely on specialized data analytics techniques such as data mining, data matching, the sounds like function, regression analysis, clustering analysis, and
Data analysis for fraud detection
Data_analysis_for_fraud_detection
Secure communication method
side information. In consequence any coding scheme that works for this problem can be used for information reconciliation. Lately turbocodes, LDPC codes
Quantum_key_distribution
Logic puzzle forming a picture in a grid
or left blank according to numbers at the edges of the grid to reveal a hidden picture. In this puzzle, the numbers are a form of discrete tomography that
Nonogram
Interdisciplinary research area
quantum pattern matching.) The problem of learning unitary transformations can be approached in a similar way. Going beyond the specific problem of learning
Quantum_machine_learning
Statistical model used in machine learning
Q.; Ben-Hamu, Heli; Nickel, Maximilian; Le, Matt (2022-10-01). "Flow Matching for Generative Modeling". arXiv:2210.02747 [cs.LG]. Grathwohl, Will; Chen
Flow-based_generative_model
Algorithm in quantum information theory
_{b}}{2}}} . Here, each bias is independently defined as the bias of the matching qubit when discarding the rest of the system (using partial trace), even
Algorithmic_cooling
Superconducting qubit implementation
qubits are much more easily scalable, but they themselves have their own problem: decoherence. Superconductors, however, have the advantage of being more
Charge_qubit
Cryptography based on quantum mechanical phenomena
offers an information-theoretically secure solution to the key-exchange problem. Quantum cryptography allows the completion of cryptographic tasks that
Quantum_cryptography
decision problem is a member of BQP if there exists a quantum algorithm (an algorithm that runs on a quantum computer) that solves the decision problem with
Glossary_of_quantum_computing
Processing of natural language by a computer
a collection of rules (e.g., a Chinese phrasebook, with questions and matching answers), the computer emulates natural language understanding (or other
Natural_language_processing
Types of quantum information
quantum algorithms composed of quantum logic gates to solve computational problems, where they are used for input/output and intermediate computations. A
Physical_and_logical_qubits
Computer science
quantum polynomial time (EQP or sometimes QP) is the class of decision problems that can be solved by a quantum computer with zero error probability and
Exact_quantum_polynomial_time
Methods in artificial intelligence research
addressing underlying problems in handling uncertainty and in knowledge acquisition. Uncertainty was addressed with formal methods such as hidden Markov models
Symbolic artificial intelligence
Symbolic_artificial_intelligence
Machine learning technique
mechanism was developed to address the weaknesses of using information from the hidden layers of recurrent neural networks. Recurrent neural networks favor information
Attention_(machine_learning)
HIDDEN MATCHING-PROBLEM
HIDDEN MATCHING-PROBLEM
Girl/Female
Gujarati, Hindu, Indian, Telugu
Watching; Guarding
Surname or Lastname
English and Scottish
English and Scottish : variant spelling of Kitchen.
Girl/Female
Muslim
Like. Equal. Matching.
Girl/Female
Afghan, Arabic, Bengali, Indian, Kannada, Marathi, Muslim
Like; Equal; Matching
Male
English
Variant spelling of English Lyndon, LINDEN means "lime tree hill." Or from the vocabulary word, linden, meaning "lime tree."
Girl/Female
American, Australian, British, Christian, English
Lives by the Linden Tree Hill
Girl/Female
English
The linden tree.
Surname or Lastname
English
English : habitational name from various places such as Headon, Nottinghamshire, Hedon in East Yorkshire, and Heddon on the Wall and Black Heddon. Northumberland. The first is probably named from Old English hēah ‘high’ + dūn ‘hill’; the others have the same second element, combined with Old English hǣþ ‘heath’, ‘heather’.North German (Frisian) : variant of Hadden.
Surname or Lastname
Scottish
Scottish : habitational name from a place so called near Kelso on the border with England. Early forms include Hadden, Hauden, and Halden; the place name is probably from Old English halh ‘nook’, ‘recess’ + denu ‘valley’.English : habitational name from a place in East Yorkshire, so named from Old Norse hǫfuð ‘head’ (replacing Old English hēafod) + Old English denu ‘valley’; the first element may have been used in the sense ‘principal’, ‘top’, or ‘end’.Americanized form of Norwegian Hovden.
Male
German
Middle High German byname HEIDEN means "heathen." The composer Josef Haydn's surname was a respelling of this name.
Surname or Lastname
Dutch, German, and Jewish (Ashkenazic)
Dutch, German, and Jewish (Ashkenazic) : variant (plural) of Linde.English : variant spelling of Lindon.Belgian and Dutch (van Linden) : habitational name from places called Linden in Brabant and North Brabant.Dutch (van der Linden) : habitational name from any of numerous places called Ter Linde.Irish : reduced form of McLinden.Swedish (Lindén) : ornamental name from lind ‘lime tree’ + the common suffix -én, from the Latin adjectival ending -enius.
Female
English
Anglicized form of Irish Gaelic ÉtaÃn, AIDEEN means "face."
Girl/Female
Indian, Punjabi, Sikh
Showing Matching of Relationship
Surname or Lastname
English
English : variant spelling of Machen.Spanish (MachÃn) : probably a nickname from machÃn ‘boor’, ‘lout’, often applied to a blacksmith’s apprentice.French : nickname from Old French machin ‘scheming’.
Boy/Male
American, Australian, British, English
From the Linden Tree Hill
Surname or Lastname
English
English : habitational name from Hidden in Berkshire or Clayhidon in Devon, recorded in Domesday Book as Hidone, from Old English hī(e)g ‘hay’ + dūn ‘hill’.
Surname or Lastname
English (Yorkshire)
English (Yorkshire) : habitational name from Hebden in North Yorkshire or Hebden Bridge in West Yorkshire, both named from Old English hēope ‘rose-hip’ + denu ‘valley’.
Surname or Lastname
English (mainly Sussex and Kent)
English (mainly Sussex and Kent) : topographic name from Middle English hilder ‘dweller on a slope’ (from Old English hylde ‘slope’).
Surname or Lastname
Scottish
Scottish : variant of Howden 1.English : variant of Haddon.Irish (Ulster and County Louth) : though mainly Scottish, this surname is sometimes used as an Anglicized form of Gaelic Ó hÉidÃn ‘descendant of ÉidÃn’ (see Hayden).North German (Frisian) : from the personal name Hadder, a derivative of any of the Germanic compound names formed with had ‘battle’, ‘strife’ as the first element.
Male
English
Variant spelling of English Aidan, AIDEN means "little fire."
HIDDEN MATCHING-PROBLEM
HIDDEN MATCHING-PROBLEM
Girl/Female
French
Boy/Male
Indian, Telugu
Soft Laugh
Male
Egyptian
, Apophis, a king of the Hykshos dynasty.
Female
Persian/Iranian
Persian name GHONCHEH means "flower bud."
Girl/Female
American, Australian, Hebrew, Japanese
Palm Tree; Date Palm; Spice; People
Boy/Male
Indian
Pleasant
Surname or Lastname
English
English : variant of Hilburn.
Boy/Male
Indian, Punjabi, Sikh
One who Loves People
Boy/Male
Arabic
Painter; Artist
Girl/Female
Indian, Marathi
Grass
HIDDEN MATCHING-PROBLEM
HIDDEN MATCHING-PROBLEM
HIDDEN MATCHING-PROBLEM
HIDDEN MATCHING-PROBLEM
HIDDEN MATCHING-PROBLEM
v. t.
To make wide or wider; to extend in breadth; to increase the width of; as, to widen a field; to widen a breach; to widen a stocking.
v. t.
A design carried out by means of the above process; a pattern on metal, glass, etc., produced by etching.
n.
The act of throwing or casting; a cast; a pitch; as, wild pitching in baseball.
a.
Having the habit of catching insects on the wing.
v. i.
To be seethed; to become sodden.
a.
Ridden by a hag or witch; hence, afflicted with nightmare.
p. p.
Boiled; seethed; also, soaked; heavy with moisture; saturated; as, sodden beef; sodden bread; sodden fields.
n.
A coarse kind of linen; -- called also harden.
n.
A method of joining timbers, scantling, etc., by notching them, as at the ends, and overlapping or interlocking the notched portions.
p. p.
of Hide
n.
Same as Hoiden.
v. t.
To subject to the action of machinery; to effect by aid of machinery; to print with a printing machine.
adv.
In a hidden manner.
a.
Controlled or oppressed by priests; as, a priest-ridden people.
a.
Approaching maturity; as, maturing fruits; maturing notes of hand.
imp. & p. p.
of Hide
a.
Of or belonging to that part or end which is in the rear, or which follows; as, the hinder part of a wagon; the hinder parts of a horse.
p. p. & a.
from Hide. Concealed; put out of view; secret; not known; mysterious.
n.
One who hides or conceals.