AI & ChatGPT searches , social queriess for GENERIC CASE-COMPLEXITY
Search references for GENERIC CASE-COMPLEXITY. Phrases containing GENERIC CASE-COMPLEXITY
See searches and references containing GENERIC CASE-COMPLEXITY!
Search references for GENERIC CASE-COMPLEXITY. Phrases containing GENERIC CASE-COMPLEXITY
See searches and references containing GENERIC CASE-COMPLEXITY!GENERIC CASE-COMPLEXITY
Generic-case complexity is a subfield of computational complexity theory that studies the complexity of computational problems on "most inputs". Generic-case
Generic-case_complexity
Conceptual framework
sociology, social complexity is a conceptual framework used in the analysis of society. In the sciences, contemporary definitions of complexity are found in
Social_complexity
American mathematician
a set of asymptotic probability one, one of several results in generic-case complexity showing that a difficult or unsolvable problem can be easy on average
Joel_David_Hamkins
Area in mathematics devoted to the study of finitely generated groups
the notion of generic-case complexity for group-theoretic and other mathematical algorithms and algebraic rigidity results for generic groups. The study
Geometric_group_theory
Concept in linguistics
ISBN 978-90-272-3104-8. {{cite book}}: |last3= has generic name (help) Wurzel, Wolfgang Ullrich (2001). "Creoles, complexity, and linguistic change (Source does not
Language_complexity
Concept in algebraic geometry
precise statements thereof, and when writing computer programs (see generic complexity). A set of points in a d-dimensional affine space (d-dimensional Euclidean
General_position
Russian-American mathematician
Myasnikov, Alexei; Schupp, Paul; Shpilrain, Vladimir (2003). "Generic-case complexity, decision problems in group theory, and random walks". Journal
Ilya_Kapovich
The principal of generic views in the study of cognition stipulates that the interpretation made by an observer of a distal phenomenon should be such
Generic_views
Function for sorting in C++ standard library
language standard and may vary across implementations, but the worst-case asymptotic complexity of the function is specified: a call to sort must perform no more
Sort_(C++)
Style of computer programming
algorithm can be applied to and such complexity requirements are a major determinant of data structure choice. Generic programming similarly has been applied
Generic_programming
Associative array for storing key–value pairs
tables are used to reduce the look-up complexity to be a guaranteed O ( 1 ) {\displaystyle O(1)} in the worst case. In this technique, the buckets of k
Hash_table
Simple sorting algorithm using comparisons
cases where the list is already mostly sorted (having a small number of inversions), despite the fact that it has worse average-case time complexity.
Bubble_sort
Tool for analyzing divide-and-conquer algorithms
{\displaystyle T(n)=\Theta (n\log \log n)} . Akra–Bazzi method Asymptotic complexity Bentley, Jon Louis; Haken, Dorothea; Saxe, James B. (September 1980),
Master theorem (analysis of algorithms)
Master_theorem_(analysis_of_algorithms)
Automotive control system
ECUs continues to increase in line count, complexity, and sophistication. Managing the increasing complexity and number of ECUs in a vehicle has become
Electronic_control_unit
Discrete Fourier transform algorithm
the modern generic FFT algorithm. While Gauss's work predated even Joseph Fourier's 1822 results, he did not analyze the method's complexity, and eventually
Fast_Fourier_transform
Hybrid sorting algorithm
thus provides worst-case linear complexity, which is optimal. Both algorithms were introduced with the purpose of providing generic algorithms for the
Introsort
Geometric group theory
Alexei G.; Weiß, Armin (2016). "Conjugacy in Baumslag's group, generic case complexity, and division in power circuits". Algorithmica. 76 (4): 961–988
Baumslag–Gersten_group
Sorting algorithm
can also be considered a comparison sort algorithm. The computational complexity depends on the algorithm used to sort each bucket, the number of buckets
Bucket_sort
Categorization of nouns and modifiers by function
δοτική, αἰτιατική, κλητική. Translation: There are five Cases, the right [nominative], the generic [genitive], the dative, the accusative, and the vocative
Grammatical_case
Selection algorithm
research. Floyd–Rivest algorithm "Generic Algorithms", David Musser "35968 – nth_element fails to meet its complexity requirements". "27.8.3 Nth element
Introselect
Variant of heap data structure
worst-case time complexity of O(log n). For a random heap, and for repeated insertions, the insertion operation has an average-case complexity of O(1)
Binary_heap
Search algorithm finding the position of a target value within a sorted array
binary search. The time complexity for this variation grows slightly more slowly, but at the cost of higher initial complexity. Knuth 1998 performed a
Binary_search
Algorithm for finding shortest paths
(|E|+|V|\log |V|)} . When using binary heaps, the average case time complexity is lower than the worst-case: assuming edge costs are drawn independently from
Dijkstra's_algorithm
Programming language
programming and noted that built-in functions were in fact type-generic, but are treated as special cases; Pike called this a weakness that might be changed at
Go_(programming_language)
Subfield of mathematical optimization
is related to operations research, algorithm theory, and computational complexity theory. It has important applications in several fields, including artificial
Combinatorial_optimization
Model of computational complexity
performed quickly (say, with unit computational cost), so the worst-case time complexity of an algorithm in the decision tree model corresponds to the depth
Decision_tree_model
Data structure that acts as a priority queue
both complexities can be amortized). Another algorithm achieves Θ(n) for binary heaps. For persistent heaps (not supporting decrease-key), a generic transformation
Binomial_heap
Closed lexical category of the English language
preserved some of the inflectional complexity of Old English and Middle English. Unlike nouns which are not inflected for case except for possession (woman/woman's)
Personal_pronouns_in_English
Data structure for priority queues
binary number system. Ordinary binomial heaps suffer from worst case logarithmic complexity for insertion, because a carry operation may cascade, analogous
Skew_binomial_heap
Medicines that are not manufactured using biotechnology
valid for follow-on versions of NBCDs. The classical generic approach disregards the complexity of NBCD compounds (pharmaceutical and biodistribution
Non-biological_complex_drugs
Sorting algorithm which uses multiple comparison intervals
Θ(N2) on the same aforementioned worst case input for Shell's original gaps. Although it has higher complexity than the O(N log N) that is optimal for
Shellsort
Mathematical concept in polynomial theory
provides a computational complexity d O ( n ) , {\displaystyle d^{O(n)},} where d is the maximum degree of input polynomials. Another case where the computation
Resultant
String searching algorithm
Java implementations below have a O ( k ) {\displaystyle O(k)} space complexity (make_delta1, makeCharTable). This is the same as the original delta1
Boyer–Moore string-search algorithm
Boyer–Moore_string-search_algorithm
Discipline for achieving objectives against unpredictability, complexity, and ambiguity
extension of the mindset or ideological perspective of the organization. Complexity theorists define strategy as the unfolding of the internal and external
Strategy
Tabletop role-playing game system
The Generic Universal Role Playing System, or GURPS, is a tabletop role-playing game system published by Steve Jackson Games. The system is designed to
GURPS
to China in telecoms scam case". The Guardian. ISSN 0261-3077. Retrieved 9 November 2025. {{cite news}}: |last2= has generic name (help) "China court sentences
Trafficking of Chinese nationals to scam centers abroad
Trafficking_of_Chinese_nationals_to_scam_centers_abroad
Data structure for priority queue operations
both complexities can be amortized). Another algorithm achieves Θ(n) for binary heaps. For persistent heaps (not supporting decrease-key), a generic transformation
Fibonacci_heap
Number of intersection points of algebraic curves and hypersurfaces
for will occur with algorithms that have a complexity that is polynomial in the Bézout bound. In the case of plane curves, Bézout's theorem was essentially
Bézout's_theorem
Software for a class of mathematical problems
mathematical problem. A solver takes problem descriptions in some sort of generic form and calculates their solution. In a solver, the emphasis is on creating
Solver
Partition of a graph by removing fewest possible edges
complexity for k > 2 {\displaystyle k>2} . Due to max-flow min-cut theorem, 2 nodes' Minimum cut value is equal to their maxflow value. In this case,
Minimum_cut
Technology used in network interface cards
to run on the system. TCP is a connection-oriented protocol which adds complexity and processing overhead. These aspects include: Connection establishment
TCP_offload_engine
Software programming optimization technique
has a specific name in computing: computational complexity. All functions have a computational complexity in time (i.e. they take time to execute) and in
Memoization
Algorithm for solving the discrete logarithm problem
has a smaller algorithmic complexity, and potentially solves the same problem. The baby-step giant-step algorithm is a generic algorithm. It works for every
Baby-step_giant-step
Latin root of the word "republic"
generally described as the Roman Republic. Res publica could also be used in a generic meaning, referring to "public affairs" and/or the general system of government
Res_publica
range of the problem cases increases. The ratio of the number of hidden objects to the total number of cells affects the complexity of the puzzle too. Schrijver
Board puzzles with algebra of binary variables
Board_puzzles_with_algebra_of_binary_variables
Generic space–time tradeoff cryptographic attack
The meet-in-the-middle attack (MITM), a known-plaintext attack, is a generic space–time tradeoff cryptographic attack against encryption schemes that
Meet-in-the-middle_attack
British snack food
Mediterranean origin. The name was not trademarked and has since become a generic term, allowing other manufacturers to create similar products under the
Jaffa_Cakes
Decision problem in computer science
in practice. SSP is a special case of the knapsack problem and of the multiple subset sum problem. The time complexity of SSP depends on two parameters:
Subset_sum_problem
programs, or as a new language that the compiler converts into generic JavaScript. In either case, the resulting programs can be run in a regular web browser
Flapjax
Computer science data structure
both complexities can be amortized). Another algorithm achieves Θ(n) for binary heaps. For persistent heaps (not supporting increase-key), a generic transformation
Heap_(data_structure)
Abstract data type in computer science
both complexities can be amortized). Another algorithm achieves Θ(n) for binary heaps. For persistent heaps (not supporting decrease-key), a generic transformation
Priority_queue
Type of error-correcting code
the message is called the query complexity of a code. The rate of a code is inversely related to the query complexity, but the exact shape of this tradeoff
Locally_decodable_code
Data structure or code used by a compiler
processors and operating systems, such as C. Languages used for this fall in complexity between high-level languages and low-level languages, such as assembly
Intermediate_representation
Federal agency of the United States Department of Health and Human Services
iPLEDGE. Generic drugs are chemical and therapeutic equivalents of name-brand drugs, normally whose patents have expired. Approved generic drugs should
Food_and_Drug_Administration
NP-complete problem in computer science
The runtime complexity is O(n log n). In the worst case, its approximation ratio is similar – at most 7/6. However, in the average case it performs much
Partition_problem
Class in computational complexity theory
In computational complexity theory, a decision problem is P-complete (complete for the complexity class P) if it is in P and every problem in P can be
P-complete
Concept in quantum mathematics
however, as the system's complexity increases (larger size or dimensions), the computation time would not increase linearly. In that case, a state-of-the-art
Quantum_random_circuits
Kinship system
lack of direct ancestry or descent. In Iroquois kinship systems, the complexity stems from promotion and/or prohibition of certain forms of cousin marriage
Sesotho_kinship
Precolumbian pottery
though some extant artifacts have survived. In both cases the huaco is associated with ceramic complexity (in its volume or decoration) and not with regular
Huaco_(pottery)
Self-balancing binary search tree
such an implementation is usually called the join-based algorithms. The complexity of each of union, intersection and difference is O ( m log ( n m + 1
Weight-balanced_tree
Theorem about complexity measures of Boolean functions
In computational complexity, the sensitivity theorem, proved by Hao Huang in 2019, states that the sensitivity of a Boolean function f : { 0 , 1 } n →
Sensitivity_theorem
Optimal data structure for priority queue operations
both complexities can be amortized). Another algorithm achieves Θ(n) for binary heaps. For persistent heaps (not supporting decrease-key), a generic transformation
Brodal_queue
Collection of classes and functions used in the C++ programming language
has poor worst-case performance, but introsort was introduced to allow both fast average performance and optimal worst-case complexity, and as of C++11
C++_Standard_Library
Lossy audio compression format
The basic profile of AAC (both MPEG-4 and MPEG-2) is called AAC-LC (Low Complexity). It is widely supported in the industry and has been adopted as the default
Advanced_Audio_Coding
enterprise integration process. Ontological theories (OT), Generic enterprise models (GEMs) and Generic modules (GMs) The building blocks were designed to support
Generalised Enterprise Reference Architecture and Methodology
Generalised_Enterprise_Reference_Architecture_and_Methodology
Canadian businessman (1942–2017)
manufacture generic versions of Eli Lilly's Prozac. Today, Barr is a part of Teva Pharmaceutical Industries, the world's largest generic drugmaker, following
Barry_Sherman
Theoretical framework
background and experience should coincide with the conceptual model's complexity, else misrepresentation of the system or misunderstanding of key system
Conceptual_model
Simulation used for training or analysis
level of preliminary instruction given may also vary depending on the complexity of the simulation. Business simulations may be played by individuals or
Business_simulation
Construction of sorting networks
Batcher's odd–even mergesort is a generic construction devised by Ken Batcher for sorting networks of size O(n (log n)2) and depth O((log n)2), where
Batcher_odd–even_mergesort
Technique to compress data
edges along the path from the root node to the symbol. In many cases, time complexity is not very important in the choice of algorithm here, since n here
Huffman_coding
Analysis of computer programs without executing them
certification have been Static Analysis (SA) and Implicit Computational Complexity (ICC). SA is algorithmic in nature: it focuses on a broad programming
Static_program_analysis
Data interface description language
ITU-T X.697 - JavaScript Object Notation Encoding Rules (JER) RFC 3641 - Generic String Encoding Rules (GSER) Karg, S (2012). "Understanding BACnet MS/TP
ASN.1
Legal methodology
IRAC say that it tends to lead to overwriting, and oversimplifying the complexity of proper legal analysis. This group believes that a good legal analysis
IRAC
Pharmaceutical drugs with patent protections
not extensively involved in searching for ready-to-sell generic biologics due to the complexity of manufacture and hurdles in extraction processes. Besides
Proprietary_drug
Type of project management technique
Manufacturing / processing synergies Technical feasibility Technical gap Complexity Technical uncertainty Operational viability Go to market Sales, marketing
Phase-gate_process
Software development methodology
address the inability of third-generation languages to alleviate the complexity of platforms and express domain concepts effectively. Notable software
Model-driven_engineering
Machine learning technique
this special case, Friedman proposes a modification to gradient boosting method which improves the quality of fit of each base learner. Generic gradient boosting
Gradient_boosting
Technique invented by Paul Cohen for proving consistency and independence results
to a larger universe V [ G ] {\displaystyle V[G]} by introducing a new "generic" object G {\displaystyle G} . Forcing was first used by Paul Cohen in 1963
Forcing_(mathematics)
Film genre
disruptive and completely normal. Rafter suggested the best way to skirt complexities of various films that may be defined as crime films as works that focus
Crime_film
List of interlinear glossing abbreviations
voice), bf (beneficiary 'focus'), lt (locative 'trigger'). Glosses for generic concepts like 'particle', 'infix', 'tense', 'object marker' and the like
List of glossing abbreviations
List_of_glossing_abbreviations
Algorithm for finding important nodes in a graph
prior algorithms. In addition, Brandes' algorithm improves on the space complexity of naive algorithms, which typically require O ( | V | 2 ) {\displaystyle
Brandes'_algorithm
Knowledge organization system (KOS), concept system, or concept scheme is the generic term used in knowledge organization (KO) for the selection of concepts
Knowledge_organization_system
Process in digital electronics and integrated circuit design
long-conjectured to be Σ 2 P {\displaystyle \Sigma _{2}^{P}} -complete in time complexity, a result finally proved in 2008, but there are effective heuristics such
Logic_optimization
Reconfigurable digital circuit element
increasing order of complexity, simple programmable logic devices (SPLDs), comprising programmable array logic, programmable logic array and generic array logic;
Programmable_logic_device
American medical doctor & academic
Fellowship and a Wiener Medal. He is best known for arguing that the complexity of biological systems and organisms might result as much from self-organization
Stuart_Kauffman
Optimal data structure for priority queues
both complexities can be amortized). Another algorithm achieves Θ(n) for binary heaps. For persistent heaps (not supporting decrease-key), a generic transformation
Strict_Fibonacci_heap
circle problem. In particular, for the case of points within rectangle an optimal algorithm of time complexity Θ ( n log n ) {\displaystyle \Theta (n\log
Largest_empty_rectangle
Residence in Philadelphia, Pennsylvania
2010-12-20. Venturi, Complexity and Contradiction in Architecture. p.188 Venturi, Robert (1998). Iconography and Electronics Upon a Generic Architecture: A
Vanna_Venturi_House
Method of quantum computing via entanglement
since been related to a number of other subjects including computational complexity, aspects of classical information-theoretic cryptography, and the AdS/CFT
Non-local_quantum_computation
Strategy to extend the lifetime of patents
sound decision for the company if it did not reduce competition by generics. In one case, product hopping of the multiple sclerosis drug glatiramer acetate
Evergreening
Type of large language model
input sequences. The standard self-attention mechanism has a quadratic complexity with respect to input sequence length, as described in Attention Is All
Generative pre-trained transformer
Generative_pre-trained_transformer
Tree data structure in which each node has at most m children
tree by a constant factor and would not affect the overall worst-case time complexity. In other words, O ( log m n ) ≡ O ( log 2 n ) {\textstyle O(\log
M-ary_tree
Problem in computer science
theorem Brouwer–Hilbert controversy Kolmogorov complexity P versus NP problem Termination analysis Worst-case execution time Calude, Cristian S. (2021). "Incompleteness
Halting_problem
Deterministic finite automaton accepting set of all suffixes of particular string
For convenience, link(q0) is defined to be q 0 {\displaystyle q_{0}} . Complexity of the algorithm may vary depending on the underlying structure used to
Suffix_automaton
of CASE tools. In general, metaCASE tools should provide generic CASE tool components that can be customised and instantiated into particular CASE tools
MetaCASE_tool
Data structure with nodes pointing to the next node
or (). The advantages of the fancy variants are often limited to the complexity of the algorithms, not in their efficiency. A circular list, in particular
Linked_list
have additive valuation functions. They asked what is the computational complexity of deciding whether CEEI exists. This question was answered soon afterwards
Fisher_market
Open internet standards organization
improve the efficiency in management of networks as they grow in size and complexity. The IETF is also standardizing protocols for autonomic networking that
Internet Engineering Task Force
Internet_Engineering_Task_Force
Differential gearbox that limits the rotational speed difference of output shafts
where they convey certain dynamic advantages, at the expense of greater complexity. In 1932, Ferdinand Porsche designed the P-Wagen Grand Prix racing car
Limited-slip_differential
Data compression approach allowing perfect reconstruction of the original data
Scientific study of digital information Kolmogorov complexity – Measure of algorithmic complexity List of codecs Lossless Transform Audio Compression
Lossless_compression
GENERIC CASE-COMPLEXITY
GENERIC CASE-COMPLEXITY
Surname or Lastname
English
English : from Anglo-Norman French cas(s)e ‘case’, ‘container’ (from Latin capsa), hence a metonymic occupational name for a maker of boxes or chests.Americanized spelling of French Caisse.Americanized spelling of Kaas.Americanized spelling of German Käse, a metonymic occupational name for a maker or seller of cheese. Compare Kaeser.
Female
English
Variant spelling of English Kate, CATE means "pure."
Male
German
Altered form of German Almeric, EMERIC means "work-power."
Male
English
Middle English surname (of Norman French origin) transferred to forename use, CHASE means "hunter."Â
Boy/Male
American, Australian, British, English, Irish
Rope-maker; A Cape
Surname or Lastname
Reduced form of Irish McCage, a variant of McCaig.English (East Anglia)
Reduced form of Irish McCage, a variant of McCaig.English (East Anglia) : from Middle English, Old French cage ‘cage’, ‘enclosure’ (Latin cavea ‘container’, ‘cave’), hence a metonymic occupational name for a maker and seller of small cages for animals or birds, or a keeper of the large public cage in which petty criminals were confined for short periods of imprisonment.
Boy/Male
Irish English
Observant; alert; vigorous.
Male
German
Old German name, GOMERIC means "man-power."
Surname or Lastname
Americanized spelling of German Kast.English (Essex, Kent)
Americanized spelling of German Kast.English (Essex, Kent) : possibly a nickname from Norman caste ‘chaste’, ‘virtuous’ (from Old French chaste).Possibly an altered spelling of French Caste, cognate with 2.
Boy/Male
American, Australian, British, Dutch, English, French, Irish
Bringer of Peace; Box
Male
English
Middle English form of Anglo-Saxon Ceneric, CENRIC means "keen power."
Female
English
(ΓÎνεσις) English name of Greek origin, derived from the word genesis, GENESIS means "creation, generation, origin, source," from gignesthai "to be born," which is related to genos "birth, descent, race." In the bible, this is the name of the first book of the Old Testament.
Surname or Lastname
English
English : metonymic occupational name for a huntsman, or rather a nickname for an exceptionally skilled huntsman, from Middle English chase ‘hunt’ (Old French chasse, from chasser ‘to hunt’, Latin captare).Southern French : topographic name for someone who lived in or by a house, probably the occupier of the most distinguished house in the village, from a southern derivative of Latin casa ‘hut’, ‘cottage’, ‘cabin’.Thomas Chase came to MA from Chesham, Buckinghamshire, England, in the 1640s, and had many prominent descendants. Samuel Chase, born in Somerset Co., MD, in 1741, was one of the first members of the U.S. Supreme Court; Philander Chase, born in Cornish, NH, in 1741 was a prominent Episcopal clergyman, and his nephew Salmon Portland Chase (1808–73), also born in Cornish, was governor of OH, a U.S. senator, and secretary of the U.S. Treasury during the Civil War.
Surname or Lastname
German
German : nickname for a swift runner or a timorous person, from Middle High German, Middle Low German hase ‘hare’.Jewish (Ashkenazic) : ornamental name from German Hase ‘hare’.English : from a Middle English nickname, Hase, from Old English hÄs ‘harsh, raucous, or hoarse voice’.Japanese : usually written with characters meaning ‘long valley’; habitational name from a place in Yamato (now Nara prefecture). Listed in the Shinsen shÅjiroku. Some bearers are descended from the Taira clan; they are found mainly in eastern Japan. Also pronounced Nagaya and Nagatani; the original pronunciation was Hatsuse, meaning ‘beginning of the strait’.
Surname or Lastname
English
English : from a Middle English personal name, Cade, a survival of the Old English personal name or byname Cada, which is probably from a Germanic root meaning ‘lump’, ‘swelling’.English : metonymic occupational name for a cooper, from Middle English, Old French cade ‘cask’, ‘barrel’ (of Germanic origin, probably akin to the root mentioned in 1).English : nickname for a gentle or inoffensive person, from Middle English cade ‘domestic animal’, ‘pet’ (of unknown origin).French (Cadé) : topographic name from cade ‘juniper’ (from Latin catanus).Bearers of the name Caddé, from Amiens, were documented in Quebec city by 1670.
Female
Welsh
Medieval Welsh name, probably GENERYS means "white lady."Â
Male
English
Short form of English Caleb, CALE means "dog" or "rabid."
Female
English
Variant spelling of English Cassie, CASEY means "she who entangles men." Compare with masculine Casey.Â
Male
Swedish
Swedish variant spelling of Scandinavian Henrik, HENRIC means "home-ruler."
Female
English
English short form of Latin Cassandra, CASS means "she who entangles men."Â
GENERIC CASE-COMPLEXITY
GENERIC CASE-COMPLEXITY
Surname or Lastname
English
English : variant of Ness.German : from Middle High German naz ‘wet’, a nickname for a heavy drinker or a topographic name for someone living on wet land.
Male
Hebrew
(סï‹×“Ö´×™) Hebrew name COWDIY means "an acquaintance of God." In the bible, this is the name of the father of Gaddiel.
Female
Japanese
(èŠ) Japanese name KIKU means "chrysanthemum."
Boy/Male
American, British, English
From the Old Town; Son of Ellis
Girl/Female
Tamil
Agnishikha | அகà¯à®¨à®¿à®·à®¿à®•à®¾
Flames of fire
Boy/Male
Australian, Hebrew, Italian
God has Healed
Male
English
Variant form of English Jeremiah, JEREMY means "Jehovah casts forth" or "Jehovah hurls."Â
Girl/Female
Australian, Portuguese
A Sweet Innocent Baby
Surname or Lastname
English (eastern counties)
English (eastern counties) : apparently a variant of German.
Girl/Female
Arabic
Pearl; Jewel
GENERIC CASE-COMPLEXITY
GENERIC CASE-COMPLEXITY
GENERIC CASE-COMPLEXITY
GENERIC CASE-COMPLEXITY
GENERIC CASE-COMPLEXITY
n.
Alt. of Gentrie
n.
Freedom from care, solicitude, or anything that annoys or disquiets; tranquillity; peace; comfort; security; as, ease of mind.
v. i.
To propose hypothetical cases.
a.
Pertaining to a genus or kind; relating to a genus, as distinct from a species, or from another genus; as, a generic description; a generic difference; a generic name.
a.
Alloyed with inferior metal; debased; as, base coin; base bullion.
v. i.
To give chase; to hunt; as, to chase around after a doctor.
n.
An inclosing frame; a casing; as, a door case; a window case.
a.
Alt. of Generical
n.
A box, sheath, or covering; as, a case for holding goods; a case for spectacles; the case of a watch; the case (capsule) of a cartridge; a case (cover) for a book.
n.
A box and its contents; the quantity contained in a box; as, a case of goods; a case of instruments.
n.
To free from anything that pains, disquiets, or oppresses; to relieve from toil or care; to give rest, repose, or tranquility to; -- often with of; as, to ease of pain; ease the body or mind.
v. t.
To cause to fall; to shed; to reflect; to throw; as, to cast a ray upon a screen; to cast light upon a subject.
n.
A rustic play; -- called also prisoner's base, prison base, or bars.
v. t.
To make or furnish with cane or rattan; as, to cane chairs.
imp. & p. p.
of Case
v. t.
To strip the skin from; as, to case a box.
v. t.
To cover or protect with, or as with, a case; to inclose.
imp. & p. p.
of Cast
n.
That which befalls, comes, or happens; an event; an instance; a circumstance, or all the circumstances; condition; state of things; affair; as, a strange case; a case of injustice; the case of the Indian tribes.