AI & ChatGPT searches , social queriess for BPP COMPLEXITY
Search references for BPP COMPLEXITY. Phrases containing BPP COMPLEXITY
See searches and references containing BPP COMPLEXITY!
Search references for BPP COMPLEXITY. Phrases containing BPP COMPLEXITY
See searches and references containing BPP COMPLEXITY!BPP COMPLEXITY
Concept in computer science
In computational complexity theory, a branch of computer science, bounded-error probabilistic polynomial time (BPP) is the class of decision problems
BPP_(complexity)
Class of problems in computer science
repetitions that is exponential in n. PP includes BPP, since probabilistic algorithms described in the definition of BPP form a subset of those in the definition
PP_(complexity)
Concept in computer science
probabilistic Turing machines, but, for clarity, note that other complexity classes based on them include BPP and RP. The class BQP is based on another machine with
ZPP_(complexity)
Set of problems in computational complexity theory
language and not in the language). BPP is the most practically relevant of the probabilistic complexity classes—problems in BPP have efficient randomized algorithms
Complexity_class
Randomized polynomial time class of computational complexity theory
NO-answer. The complexity class co-RP is the complement, where a YES-answer might be wrong while a NO-answer is always right. The class BPP describes algorithms
RP_(complexity)
Inherent difficulty of computational problems
EXPSPACE = NEXPSPACE by Savitch's theorem. Other important complexity classes include BPP, ZPP and RP, which are defined using probabilistic Turing machines;
Computational complexity theory
Computational_complexity_theory
Complexity class used to classify decision problems
problems in computer science In computational complexity theory, NP (nondeterministic polynomial time) is a complexity class used to classify decision problems
NP_(complexity)
Topics referred to by the same term
Look up bpp in Wiktionary, the free dictionary. BPP may refer to: BPP Holdings, a holding company based in the United Kingdom BPP Law School, a law school
BPP
Estimate of time taken for running an algorithm
complexity class of decision problems that can be solved with 1-sided error on a probabilistic Turing machine in polynomial time. BPP: The complexity
Time_complexity
Class of problems solvable in polynomial time
In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is a fundamental complexity class. It contains all decision problems that can
P_(complexity)
Computational complexity of quantum algorithms
main aims of quantum complexity theory is to find out how these classes relate to classical complexity classes such as P, NP, BPP, and PSPACE. One of the
Quantum_complexity_theory
Computational complexity class of problems
at most 1/3 for all instances. It is the quantum analogue to the complexity class BPP. A decision problem is a member of BQP if there exists a quantum
BQP
Interactive proof system in computational complexity theory
In computational complexity theory, an Arthur–Merlin protocol, introduced by Babai (1985), is an interactive proof system in which the verifier's coin
Arthur–Merlin_protocol
Algorithm that employs a degree of randomness as part of its logic or procedure
increasing their running time. For instance, in computational complexity, it is unknown whether P = BPP, i.e., we do not know whether we can take an arbitrary
Randomized_algorithm
Overview of and topical guide to algorithms
method Fast multipole method P (complexity) NP (complexity) NP-completeness NP-hardness EXPTIME PSPACE BPP (complexity) BQP Undecidable problem Halting
Outline_of_algorithms
Class of computational complexity
}{=}}PSPACE}}} More unsolved problems in computer science In computational complexity theory, PSPACE is the set of all decision problems that can be solved
PSPACE
Alexander; Sundaram, Ravi (1998). "Symmetric alternation captures BPP". Computational Complexity. 7 (2). Birkhäuser Verlag: 152–162. doi:10.1007/s000370050007
S2P_(complexity)
Bounded-error probabilistic polynomial time is contained in the polynomial time hierarchy
computational complexity theory, the Sipser–Lautemann theorem or Sipser–Gács–Lautemann theorem states that bounded-error probabilistic polynomial (BPP) time is
Sipser–Lautemann_theorem
Complexity class (logarithmic space)
versions: BPP, ZPP, PP, and RP, there are several random versions of L. Bounded-error Probability L (BPL) is defined like BPP, as the complexity class of
L_(complexity)
Notion of the "hardest" or "most general" problem in a complexity class
In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest" (or
Complete_(complexity)
In computational complexity theory, the complement of a decision problem is the decision problem resulting from reversing the yes and no answers. Equivalently
Complement_(complexity)
Mathematical model of computation
includes several important complexity classes is allowing for an error probability of 1/3. For instance, the complexity class BPP is defined as the class
Probabilistic_Turing_machine
computational complexity theory of computer science, the structural complexity theory or simply structural complexity is the study of complexity classes, rather
Structural_complexity_theory
Computer science concept
computational complexity theory, the polynomial hierarchy (sometimes called the polynomial-time hierarchy) is a hierarchy of complexity classes that generalize
Polynomial_hierarchy
Computational complexity class
Allender, E.; Strauss, M. (1994), "Measure on small complexity classes with applications for BPP", Proceedings of IEEE FOCS'94, pp. 807–818, ECCC TR94-004
E_(complexity)
Computational input that relies on the length but not content of the input
In computational complexity theory, an advice string is an extra input to a Turing machine that is allowed to depend on the length n of the input, but
Advice_(complexity)
In computational complexity theory, a language B (or a complexity class B) is said to be low for a complexity class A (with some reasonable relativized
Low_(complexity)
Complexity of sending information in a distributed algorithm
In theoretical computer science, communication complexity studies the amount of communication required to solve a problem when the input to the problem
Communication_complexity
Quantum algorithm
algorithm was designed to prove an oracle separation between complexity classes BQP and BPP. Given an oracle that implements a function f : { 0 , 1 } n
Bernstein–Vazirani_algorithm
Set of problems solved by small circuits
computational complexity theory, P/poly is a complexity class that can be defined in both circuit complexity and non-uniform complexity. Since the two
P/poly
Complexity class
computational complexity theory, co-NP is a complexity class. A decision problem X is a member of co-NP if and only if its complement X is in the complexity class
Co-NP
List of unsolved computational problems
the relationship between BQP and NP? NC = P problem NP = co-NP problem P = BPP problem P = PSPACE problem L = NL problem PH = PSPACE problem L = P problem
List of unsolved problems in computer science
List_of_unsolved_problems_in_computer_science
Digital electronic representation of moving visual images
severely impacted for scenes of high complexity, some algorithms try to constantly adjust the BPP. They keep the BPP high while compressing complex scenes
Digital_video
American computer scientist
Complexity. 13 (1): 1–46. doi:10.1007/s00037-004-0182-6. ISSN 1420-8954. S2CID 12451799. Impagliazzo, Russell; Wigderson, Avi (1997-05-04). "P = BPP if
Russell_Impagliazzo
Quantum Merlin Arthur
between the complexity classes NP and P. It is also analogous to the relationship between the probabilistic complexity classes MA and BPP. QAM is a related
QMA
of complexity classes in computational complexity theory. For other computational and complexity subjects, see list of computability and complexity topics
List_of_complexity_classes
Model of computational complexity
In theoretical computer science, circuit complexity is a branch of computational complexity theory in which Boolean functions are classified according
Circuit_complexity
Type of randomized algorithm
k times and returning the majority function of the answers. The complexity class BPP describes decision problems that can be solved by polynomial-time
Monte_Carlo_algorithm
Problem in computer science
separation between the complexity classes BPP (bounded-error classical query complexity) and BQP (bounded-error quantum query complexity). This is the same
Simon's_problem
Computer hardware technology that uses quantum mechanics
Q P {\displaystyle {\mathsf {BPP\subseteq BQP}}} but there is no proof B Q P ≠ B P P {\displaystyle {\mathsf {BQP\neq BPP}}} , which intuitively would
Quantum_computing
Complexity class
reject with probability greater than 2/3. In IP, the verifier is like a BPP machine. In QIP, the communication between the prover and verifier is quantum
QIP_(complexity)
Complexity class from interactive proofs
In computational complexity theory, the class IP (which stands for interactive proof) is the class of problems solvable by an interactive proof system
IP_(complexity)
On collapse of the polynomial hierarchy if NP is in non-uniform polynomial time class
If NP is assumed to be a subset of BPP (which is a subset of P/poly), then the polynomial hierarchy collapses to BPP. If coNP is assumed to be subset of
Karp–Lipton_theorem
Problem a computer might be able to solve
machines. For example, the complexity classes P, problems that consume polynomial time for deterministic classical machines BPP, problems that consume polynomial
Computational_problem
natural numbers are a mathematical model used in studying computational complexity theory. They are a special case of circuits. The object is a labeled directed
Circuits over sets of natural numbers
Circuits_over_sets_of_natural_numbers
Video compression method for HDMI and DisplayPort links
variable bitrate mode. The minimum allowed bits-per-pixel (BPP) is 6 bit/px; the typical BPP given on VESA's website is 8 bit/px. The variable-bitrate
Display_Stream_Compression
In computational complexity theory, the complexity class ⊕P (pronounced "parity P") is the class of decision problems solvable by a nondeterministic Turing
Parity_P
Recording a business transaction as debit and credit
Accounting (FA) Study Text. BPP Learning Media. p. 195. ACCA (2024). "7: The Trial Balance". Financial Accounting (FA) Study Text. BPP Learning Media. p. 196
Double-entry_bookkeeping
Problem of determining if a Boolean formula could be made true
property is used in several theorems in complexity theory: NP ⊆ P/poly ⇒ PH = Σ2 (Karp–Lipton theorem) NP ⊆ BPP ⇒ NP = RP P = NP ⇒ FP = FNP Since the SAT
Boolean satisfiability problem
Boolean_satisfiability_problem
Concept in computational complexity theory
probabilistic Turing machines with two-sided error. It is named in analogy with BPP, which is similar but has no logarithmic space restriction. The probabilistic
BPL_(complexity)
Model of computation
{\displaystyle [1/2+1/q(n),1]} for YES instances. Most probabilistic classes, such as BPP, BQP, and RP are agnostic to the precise probability gap, because any polynomial
One_clean_qubit
Thesis on the nature of computability
probabilistic polynomial time (BPP) equals deterministic polynomial time (P), the word 'probabilistic' is optional in the complexity-theoretic Church–Turing
Church–Turing_thesis
Low-latency video compression standard
special-purpose codec that is specifically designed to allow for low-complexity and low-latency implementations. Target applications of the standard include
JPEG_XS
Exponential function of an exponential function
Witteveen & Jeffery showed that any QMA protocol can be amplified (see BPP) to have doubly-exponential error (with mild constraints on choice of gate
Double_exponential_function
Complexity class used in circuit complexity
theoretical computer science, and specifically computational complexity theory and circuit complexity, TC0 (Threshold Circuit) is the first class in the hierarchy
TC0
Hungarian-American mathematician and computer scientist
eds. Mathematical evolutions. MAA, 2002. Lautemann, Clemens (1983-11-08). "BPP and the polynomial hierarchy". Information Processing Letters. 17 (4): 215–217
Peter_Gacs
Problem in linear algebra
Stockmeyer counting, they can be computed within the class BPP NP {\displaystyle {\textsf {BPP}}^{\textsf {NP}}} , but this is considered an infeasible
Computing_the_permanent
Abstract machine that models computation
are no less practical to verify, since BPP algorithms are considered as abstracting practical computation (see BPP). In a public coin protocol, the random
Interactive_proof_system
American theoretical computer scientist (born 1954)
and Johan Håstad. In an early derandomization theorem, Sipser showed that BPP is contained in the polynomial hierarchy, subsequently improved by Peter
Michael_Sipser
Experimental technology level
suggests that NISQ algorithms occupy a computational complexity class strictly between classical computing (BPP) and ideal quantum computing (BQP), experimental
Noisy intermediate-scale quantum computing
Noisy_intermediate-scale_quantum_computing
Video compression technology
lossy compression that can achieve a bitrate as low as 1 bit per pixel (bpp). TICO achieves near-zero latency, processing images within mere fractions
TICO_(codec)
Search problem in quantum mechanics
problem was designed to prove an oracle separation between complexity classes BQP and BPP, 2D HLF was designed to prove an explicit separation between
Hidden linear function problem
Hidden_linear_function_problem
Algorithm to be run on quantum computers
1/3 for all instances. It is the quantum analogue to the classical complexity class BPP. A problem is BQP-complete if it is in BQP and any problem in BQP
Quantum_algorithm
Political party in Botswana
African nationalist and socialist-based Bechuanaland People's Party (BPP). The BPP was the first mass party in the country and the first to demand total
Botswana_Democratic_Party
2010 single by Paramore
Brasil (in Portuguese). Brazil: BPP: 79. June 2010. "Brasil Hot 100 Airplay". Billboard Brasil (in Portuguese). Brazil: BPP: 84. August 2010. Kyle Anderson
The_Only_Exception
Proving validity without revealing other data
the standard model, interaction is required, except for trivial proofs of BPP problems. In the common random string and random oracle models, non-interactive
Zero-knowledge_proof
Decay of nuclear spin polarization in MRI and NMR
functions depend on the physical system, but a simple approximation called the BPP theory is widely used. Another relaxation mechanism is the electrostatic
Relaxation_(NMR)
Italian-American computer scientist (born 1954)
2025-08-23. Moshkovitz, Dana (Fall 2012). "Lecture 20: P vs BPP 1" (PDF). MIT: Advanced Complexity Theory. Retrieved 2025-08-23. Parberry, Ian. "1993 Gödel
Silvio_Micali
Restricted model of non-universal quantum computation
algorithm implies the simulability of postselected linear optics in the PostBPP class (that is, classical polynomial-time with postselection, known also
Boson_sampling
Formal concept in theoretical computer science and cryptography
in polynomial time. The existence of such a simulation would imply that BPP = P. To perform such a simulation, it is sufficient to construct pseudorandom
Pseudorandom_generator
Deterministic quantum algorithm
probabilistic classical computer, it does not yield an oracle separation with BPP, the class of problems that can be solved with bounded error in polynomial
Deutsch–Jozsa_algorithm
Class of enzymes
In enzymology, bornyl diphosphate synthase (BPPS) (EC 5.5.1.8) is an enzyme that catalyzes the chemical reaction geranyl diphosphate ⇌ {\displaystyle \rightleftharpoons
Bornyl_diphosphate_synthase
Type of cryptographic software obfuscation
average; iO does not exist.[dubious – discuss] Pessiland: In this case, BPP ≠ NP, but one-way functions do not exist; as a result, iO does not exist
Indistinguishability obfuscation
Indistinguishability_obfuscation
Country in Southern and Western Europe
dell'Ateneo & Bizzarri, Roma, 1980 "II 1987: Uomini e vicende di Magna Grecia". bpp.it. Archived from the original on 4 February 2021. Retrieved 31 January 2021
Italy
} ). This argument has wide use in complexity theory (e.g. proving B P P ⊊ P / p o l y {\displaystyle {\mathsf {BPP}}\subsetneq {\mathsf {P/poly}}} ) and
Averaging_argument
Greek mathematician and logician (born 1947)
Zachos, Stathis; Hans Heller (1986). "A decisive characterization of BPP". Information and Control. 69 (1–3): 125–135. doi:10.1016/s0019-9958(86)80044-4
Stathis_Zachos
Concept in behavioral economics, political theory and behavioral sciences
three concepts". Behavioural Public Policy. 2 (1): 107–124. doi:10.1017/bpp.2016.16. Gane, Nicholas (2021). "Nudge Economics as Libertarian Paternalism"
Nudge_theory
at most 1/3 for all instances. It is the quantum analogue to the complexity class BPP. A decision problem is a member of BQP if there exists a quantum
Glossary_of_quantum_computing
enlightened self-government". Behavioural Public Policy. 1 (1): 54–86. doi:10.1017/bpp.2016.2. hdl:1794/18962. ISSN 2398-063X. Kahan, Dan M.; Braman, Donald (April
Political polarization in the United States
Political_polarization_in_the_United_States
Addition to JPEG standard
otherwise it is not very widely used because of complexity of doing arithmetics on 10, 12, or 14 bpp values on typical embedded 32-bit processor and a
Lossless_JPEG
1988 memoir by Assata Shakur
Chapter 15 focuses on Shakur's journey as a member of the Black Panther Party (BPP). As she first walks down the streets of Harlem on her first day as a member
Assata:_An_Autobiography
build room temperature quantum computers? Complexity classes problems: What is the relation between BQP and BPP? What is the relation between BQP and NP
List of unsolved problems in physics
List_of_unsolved_problems_in_physics
Polymer consisting of repeating units of a coordination complex
3-bis(4-pyridyl)propane (bpp). A systematic investigation of the effects of the counterions and a survey of the coordination polymers based on bpp". CrystEngComm
Coordination_polymer
Public university in Coventry, England
the Washington Consensus, computing standards, including ISO and ECMA, complexity theory, contract theory, and the International Political Economy as a
University_of_Warwick
relies on AVDTP and GAVDP. It includes mandatory support for the low-complexity SBC codec (not to be confused with Bluetooth's voice-signal codecs such
List_of_Bluetooth_profiles
2010 single by Katy Perry
Billboard Brasil (Brazil: bpp) (2): 100. October 18, 2010. "Brasil Hot Pop & Popular Songs". Billboard Brasil (Brasil: bpp) (2): 97. October/November
Teenage Dream (Katy Perry song)
Teenage_Dream_(Katy_Perry_song)
American right-wing populist political ideology
Behavioural Public Policy. 1 (1). Cambridge University Press: 54–86. doi:10.1017/bpp.2016.2. hdl:1794/18962. S2CID 231735365. Kaul, Nitasha (June 17, 2021). "The
Trumpism
American biologist
They One, or Many?", European Journal of Operational Research, v. 37, 1988. bpp. 8–33. 1990s Troncale, Len. D. Williams, J. Putinier, and J. Cramer (1990b)
Len_R._Troncale
Display mode used in Commodore Amiga computers
PC-style graphics cards offering modes such as 800×600 SVGA in hi-color (16 bpp, or 65536 directly-selectable colors) were already available for the Amiga
Hold-And-Modify
Canadian theoretical physicist (1960–2025)
mixed state. This model defines a complexity class which is thought to be intermediate between classical computation (BPP) and full quantum computing (BQP):
Raymond_Laflamme
1954–1968 U.S. social movement
often featuring braids, extensions, and dreadlocks. The Black Panther Party (BPP), founded by Huey Newton and Bobby Seale in Oakland, California in 1966,
Civil_rights_movement
algorithm was designed to prove an oracle separation between complexity classes BQP and BPP. Research groups at Max Planck Institute of Quantum Optics (Garching)
Timeline of quantum computing and communication
Timeline_of_quantum_computing_and_communication
Interdisciplinary study of the relationship between political and psychological processes
Enlightened Self-Government". Behavioural Public Policy. 1 (1): 54–86. doi:10.1017/bpp.2016.2. hdl:1794/18962. ISSN 2398-0648. Lopez, Anthony C.; McDermott, Rose;
Political_psychology
Ethnic group
2021. Retrieved 2023-08-07. "The Population and Housing Census Report (BPP) 2021: Demographic, Household and Housing Characteristics" (PDF). deps.mofe
Indian_diaspora
Positive emotional state
Growth and Subjective Well-Being: Reassessing the Easterlin Paradox" (PDF). bpp.wharton.upenn.edu. Archived from the original (PDF) on 17 June 2012. Akst
Happiness
Study of venoms
36% of SVMP's being the majority of the ESTs followed by PLA2 (26%) and BPP/C-NP (17%) sequences. Furthermore, this study shows that through both the
Venomics
Public research university in the UK
material in the module and a level (1, 2, 3, or 4) corresponding to the complexity, with 120 credits roughly equating to the year of study for a full-time
Open_University
British lawyer, podcaster and King's Counsel member
College, Oxford. He later completed the law conversion and Bar courses at BPP University, London. He was called to the Bar in 2007 and was a pupil at Francis
Tom_Cross_(barrister)
2012 single by Christina Aguilera
Aguilera – Your Body" (in French). Ultratip. Retrieved February 3, 2014. BPP (ed.). "Billboard Brasil Hot 100 Airplay". Billboard Brasil (38): 84–89.
Your Body (Christina Aguilera song)
Your_Body_(Christina_Aguilera_song)
December 2018 – via Google Books. Media, BPP Learning (1 August 2012). CIMA P1: Performance Operations Study Text. BPP Learning Media. ISBN 9781445392653.
Backflush_accounting
BPP COMPLEXITY
BPP COMPLEXITY
Surname or Lastname
English
English : nickname from some fancied resemblance to the songbird (Emberiza spp.).German : patronymic from an unexplained Frisian-Lower Saxon personal name, or a derivative of Bunt- (see Bunten).Sarah Bunting (1686–1762), born in Matlock, Derbyshire, became a noted Quaker minister in Cross Wicks, NJ. It is believed but not certain that other members of her family, including her father, John Bunting, came with her to NJ sometime before 1704, when her marriage to William Murfin is recorded.
Surname or Lastname
English
English : habitational name from any of the numerous places called Upton. The majority of them are named from Old English up- ‘upper’ + tūn ‘enclosure’, ‘settlement’. One in Essex, however, was originally named with the phrase upp in tūne ‘up in the settlement’, i.e. the higher part of the settlement; and one in Worcestershire is probably so called from the Old English personal name Ubba + tūn.
Surname or Lastname
German
German : occupational name or status name from the German word Knapp(e), a variant of Knabe ‘young unmarried man’. In the 15th century this spelling acquired the separate, specialized meanings ‘servant’, ‘apprentice’, or ‘miner’.German : in Franconia, a nickname for a dexterous or skillful person.English : topographic name for someone who lived by a hillock, Middle English knappe, Old English cnæpp, or habitational name from any of the several minor places named with the word, in particular Knapp in Hampshire and Knepp in Sussex.German and western Slavic : variant of Knabe.
Surname or Lastname
English
English : variant of Bubb.German : variant of Bopp.
Surname or Lastname
English
English : unexplained.Probably a variant or variant spelling of Opp, from a short form of a Germanic personal name formed with Åd ‘inherited wealth’, or of Opperman.
Surname or Lastname
English
English : variant of Apps or Ebbs.English : from the Old English personal name Eoppa or Old Danish Øpi.Dutch : patronymic from Epp(e), a pet form of the Germanic personal name Eberhardt.Dutch : habitational name for someone from a place called Epse (see Van Epps).
Male
Swiss
, supplanter.
Surname or Lastname
English
English : habitational name from Upchurch, a place in Kent, named from Old English upp ‘up’ + cirice ‘church’, i.e. ‘church standing high up’.
Surname or Lastname
English
English : of uncertain origin; perhaps from Middle English atte knappe (from Old English cnæpp ‘hill’ or ‘summit’), a topographic name for someone who lived at the top of a hill.
Surname or Lastname
English
English : habitational name for someone from Upham in Hampshire or from minor places so named in Devon and Wiltshire. The first is named with Old English upp ‘upper’ + hÄm ‘homestead’ or hamm ‘river meadow’, ‘enclosure hemmed in by water’.
Surname or Lastname
English (East Anglia)
English (East Anglia) : probably a habitational name from a lost or unidentified place named with Old English upp ‘up(per)’ + sc(e)aga ‘copse’, or a topographic name with the same meaning.
BPP COMPLEXITY
BPP COMPLEXITY
Girl/Female
Indian, Punjabi, Sikh
Support of the Goddess
Female
Scottish
Scottish Gaelic form of French Jeanne, SÃŒNE means "God is gracious."
Girl/Female
Muslim
Humble
Boy/Male
English
Biblical Shadrach; one of three young Hebrew men who survived being cast into a fiery furnace.
Boy/Male
Latin American Greek English Gaelic
Kind.
Girl/Female
Indian, Punjabi, Sikh
Trust; Belief
Girl/Female
Biblical
A fountain, answer, affliction.
Girl/Female
Arabic, Muslim
To Tend
Girl/Female
Latin
Laurel tree or sweet bay tree (symbols of honour and victory).
Girl/Female
Portuguese American
Form of the Greek Catherine meaning pure.
BPP COMPLEXITY
BPP COMPLEXITY
BPP COMPLEXITY
BPP COMPLEXITY
BPP COMPLEXITY
n.
The act or process of complicating; the state of being complicated; intricate or confused relation of parts; entanglement; complexity.
n.
An assemblage of parts or organs, either in animal or plant, essential to the performance of some particular function or functions which as a rule are of greater complexity than those manifested by a single organ; as, the capillary system, the muscular system, the digestive system, etc.; hence, the whole body as a functional unity.
a.
Of or pertaining to katabolism; as, katabolic processes, which give rise to substances (katastates) of decreasing complexity and increasing stability.
pl.
of Complexity
n.
A rearrangement or concentration of the different constituents of one or more substances into a distinct and definite compound of greater complexity and molecular weight, often resulting in an increase of density, as the condensation of oxygen into ozone, or of acetone into mesitylene.
n.
The state of being complex; intricacy; entanglement.
n.
Complexity.
a.
Very soft; -- a direction to execute a passage as softly as possible. (Abbrev. pp.)
n.
That which is complex; intricacy; complication.
imp. & pp.
of Classify
n.
The state of being complex; complexity.
n.
The state or quality of being intricate or entangled; perplexity; involution; complication; complexity; that which is intricate or involved; as, the intricacy of a knot; the intricacy of accounts; the intricacy of a cause in controversy; the intricacy of a plot.
n.
A genus of long, slender, wormlike bivalve mollusks which bore into submerged wood, such as the piles of wharves, bottoms of ships, etc.; -- called also shipworm. See Shipworm. See Illust. in App.
n.
A ruffian; one who hounds, or spies upon, another; app. esp. to the members of certain alleged societies among the Chinese.
n.
The state of being complex; complexity.