Endocannabinoid systemThe endocannabinoid system (ECS) is a biological system composed of endocannabinoids, which are endogenous lipid-based retrograde neurotransmitters that bind to cannabinoid receptors (CBRs), and cannabinoid receptor proteins that are expressed throughout the vertebrate central nervous system (including the brain) and peripheral nervous system.
CannabinoidCannabinoids (kəˈnæbənɔɪdz,_ˈkænəbənɔɪdz) are several structural classes of compounds found in the cannabis plant primarily and most animal organisms (although insects lack such receptors) or as synthetic compounds. The most notable cannabinoid is the phytocannabinoid tetrahydrocannabinol (THC) (delta-9-THC), the primary psychoactive compound in cannabis. Cannabidiol (CBD) is also a major constituent of temperate cannabis plants and a minor constituent in tropical varieties.
Computational complexity theoryIn theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and relating these classes to each other. A computational problem is a task solved by a computer. A computation problem is solvable by mechanical application of mathematical steps, such as an algorithm. A problem is regarded as inherently difficult if its solution requires significant resources, whatever the algorithm used.
Reduction (complexity)In computability theory and computational complexity theory, a reduction is an algorithm for transforming one problem into another problem. A sufficiently efficient reduction from one problem to another may be used to show that the second problem is at least as difficult as the first. Intuitively, problem A is reducible to problem B, if an algorithm for solving problem B efficiently (if it existed) could also be used as a subroutine to solve problem A efficiently. When this is true, solving A cannot be harder than solving B.
Complexity classIn computational complexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly analyzed resources are time and memory. In general, a complexity class is defined in terms of a type of computational problem, a model of computation, and a bounded resource like time or memory. In particular, most complexity classes consist of decision problems that are solvable with a Turing machine, and are differentiated by their time or space (memory) requirements.
N-AcylethanolamineAn N-acylethanolamine (NAE) is a type of fatty acid amide where one of several types of acyl groups is linked to the nitrogen atom of ethanolamine, and highly metabolic formed by intake of essential fatty acids through diet by 20:4, n-6 and 22:6, n-3 fatty acids, and when the body is physically and psychologically active,.
Computational complexityIn computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time (generally measured by the number of needed elementary operations) and memory storage requirements. The complexity of a problem is the complexity of the best algorithms that allow solving the problem. The study of the complexity of explicitly given algorithms is called analysis of algorithms, while the study of the complexity of problems is called computational complexity theory.
Parameterized complexityIn computer science, parameterized complexity is a branch of computational complexity theory that focuses on classifying computational problems according to their inherent difficulty with respect to multiple parameters of the input or output. The complexity of a problem is then measured as a function of those parameters. This allows the classification of NP-hard problems on a finer scale than in the classical setting, where the complexity of a problem is only measured as a function of the number of bits in the input.
Cannabinoid receptorCannabinoid receptors, located throughout the body, are part of the endocannabinoid system of vertebrates a class of cell membrane receptors in the G protein-coupled receptor superfamily. As is typical of G protein-coupled receptors, the cannabinoid receptors contain seven transmembrane spanning domains. Cannabinoid receptors are activated by three major groups of ligands: endocannabinoids; phytocannabinoids (plant-derived such as tetrahydrocannabinol (THC) produced by cannabis); and synthetic cannabinoids (such as HU-210).
Space complexityThe space complexity of an algorithm or a computer program is the amount of memory space required to solve an instance of the computational problem as a function of characteristics of the input. It is the memory required by an algorithm until it executes completely. This includes the memory space used by its inputs, called input space, and any other (auxiliary) memory it uses during execution, which is called auxiliary space. Similar to time complexity, space complexity is often expressed asymptotically in big O notation, such as etc.
