Swiss PlateauThe Swiss Plateau or Central Plateau (Schweizer Mittelland; plateau suisse; altopiano svizzero) is one of the three major landscapes in Switzerland, lying between the Jura Mountains and the Swiss Alps. It covers about 30% of the Swiss surface area, and is partly flat but mostly hilly. The average height is between and AMSL. It is by far the most densely populated region of Switzerland, the center of economy and important transportation. In the north and northwest, the Swiss Plateau is sharply delimited geographically and geologically by the Jura Mountains.
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.
ComplexityComplexity characterises the behaviour of a system or model whose components interact in multiple ways and follow local rules, leading to non-linearity, randomness, collective dynamics, hierarchy, and emergence. The term is generally used to characterize something with many parts where those parts interact with each other in multiple ways, culminating in a higher order of emergence greater than the sum of its parts. The study of these complex linkages at various scales is the main goal of complex systems 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.
P (complexity)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 be solved by a deterministic Turing machine using a polynomial amount of computation time, or polynomial time. Cobham's thesis holds that P is the class of computational problems that are "efficiently solvable" or "tractable". This is inexact: in practice, some problems not known to be in P have practical solutions, and some that are in P do not, but this is a useful rule of thumb.
Groundwater modelGroundwater models are computer models of groundwater flow systems, and are used by hydrologists and hydrogeologists. Groundwater models are used to simulate and predict aquifer conditions. An unambiguous definition of "groundwater model" is difficult to give, but there are many common characteristics. A groundwater model may be a scale model or an electric model of a groundwater situation or aquifer. Groundwater models are used to represent the natural groundwater flow in the environment.
Petroleum geologyPetroleum geology is the study of origin, occurrence, movement, accumulation, and exploration of hydrocarbon fuels. It refers to the specific set of geological disciplines that are applied to the search for hydrocarbons (oil exploration). Petroleum geology is principally concerned with the evaluation of seven key elements in sedimentary basins: Source Reservoir Seal Trap Timing Maturation Migration In general, all these elements must be assessed via a limited 'window' into the subsurface world, provided by one (or possibly more) exploration wells.
Urban planningUrban planning, also known as town planning, city planning, regional planning, or rural planning, is a technical and political process that is focused on the development and design of land use and the built environment, including air, water, and the infrastructure passing into and out of urban areas, such as transportation, communications, and distribution networks and their accessibility.
Geological engineeringGeological engineering is a discipline of engineering concerned with the application of geological science and engineering principles to fields, such as civil engineering, mining, environmental engineering, and forestry, among others. The work of geological engineers often directs or supports the work of other engineering disciplines such as assessing the suitability of locations for civil engineering, environmental engineering, mining operations, and oil and gas projects by conducting geological, geoenvironmental, geophysical, and geotechnical studies.
EngineeringEngineering is the practice of using natural science, mathematics, and the engineering design process to solve problems, increase efficiency and productivity, and improve systems. Modern engineering comprises many subfields which include designing and creating infrastructure, machinery, vehicles, electronics, materials, and energy. The discipline of engineering encompasses a broad range of more specialized fields of engineering, each with a more specific emphasis on particular areas of applied mathematics, applied science, and types of application.
Grain boundaryIn materials science, a grain boundary is the interface between two grains, or crystallites, in a polycrystalline material. Grain boundaries are two-dimensional defects in the crystal structure, and tend to decrease the electrical and thermal conductivity of the material. Most grain boundaries are preferred sites for the onset of corrosion and for the precipitation of new phases from the solid. They are also important to many of the mechanisms of creep.
Kolmogorov complexityIn algorithmic information theory (a subfield of computer science and mathematics), the Kolmogorov complexity of an object, such as a piece of text, is the length of a shortest computer program (in a predetermined programming language) that produces the object as output. It is a measure of the computational resources needed to specify the object, and is also known as algorithmic complexity, Solomonoff–Kolmogorov–Chaitin complexity, program-size complexity, descriptive complexity, or algorithmic entropy.
