Urban geographyUrban geography is the subdiscipline of geography that derives from a study of cities and urban processes. Urban geographers and urbanists examine various aspects of urban life and the built environment. Scholars, activists, and the public have participated in, studied, and critiqued flows of economic and natural resources, human and non-human bodies, patterns of development and infrastructure, political and institutional activities, governance, decay and renewal, and notions of socio-spatial inclusions, exclusions, and everyday life.
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.
Urban historyUrban history is a field of history that examines the historical nature of cities and towns, and the process of urbanization. The approach is often multidisciplinary, crossing boundaries into fields like social history, architectural history, urban sociology, urban geography, business history, and archaeology. Urbanization and industrialization were popular themes for 20th-century historians, often tied to an implicit model of modernization, or the transformation of rural traditional societies.
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.
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.
Show more