Search references for TOPOLOGICAL COMPLEXITY. Phrases containing TOPOLOGICAL COMPLEXITY
See searches and references containing TOPOLOGICAL COMPLEXITY!TOPOLOGICAL COMPLEXITY
Concept in topology
In mathematics, topological complexity of a topological space X (also denoted by TC(X)) is a topological invariant closely connected to the motion planning
Topological_complexity
Number of "holes" of a surface
along the chain. Such a function (called the genus trace) shows the topological complexity and domain structure of biomolecules. Arithmetic genus Geometric
Genus_(mathematics)
Node ordering for directed acyclic graphs
In computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed
Topological_sorting
Topological complexity in mathematics
norm) is a measure of the topological complexity of a manifold. More generally, the simplicial norm measures the complexity of homology classes. Given
Simplicial_volume
Number representing system complexity
mathematics, the topological entropy of a topological dynamical system is a nonnegative extended real number that is a measure of the complexity of the system
Topological_entropy
introduced by William Thurston, which measures in a natural way the topological complexity of homology classes represented by surfaces. Let M be a differentiable
Thurston_norm
Concept in topology
functions are said to be topologically conjugate if there exists a homeomorphism that will conjugate the one into the other. Topological conjugacy, and related-but-distinct
Topological_conjugacy
Topological operation of turning a sphere inside-out without creasing
eversion can be described by a set of closed equations giving minimal topological complexity A six-dimensional sphere S 6 {\displaystyle S^{6}} in seven-dimensional
Sphere_eversion
Soviet and American mathematician (born 1934)
first example of a topological quantum field theory. The Schwarz genus, one of the fundamental notions of topological complexity, is named after him
Albert_Schwarz
Mathematical method for optimizing material layout under given conditions
while 0 indicates an absence of material. Owing to the attainable topological complexity of the design being dependent on the number of elements, a large
Topology_optimization
Mathematical subject
The mathematical discipline of topological combinatorics is the application of topological and algebro-topological methods to solve problems in combinatorics
Topological_combinatorics
Research field in deep learning
graphs, or general topological spaces like simplicial complexes and CW complexes. TDL addresses this by incorporating topological concepts to process
Topological_deep_learning
Concerned with the notion of stability in model theory
by restricting the topological complexity of the type spaces. However, Morley showed that (for countable theories) this topological restriction is equivalent
Stable_theory
of topological index. To increase the discrimination capability a few topological indices may be combined to superindex. Computational complexity is another
Topological_index
Feature of systems that defy description
Complexity characterizes the behavior of a system or model whose components interact in multiple ways and follow local rules, leading to non-linearity
Complexity
Concept in mathematics
(physics) State space (physics) Farber, Michael; Grant, Mark (2009). "Topological complexity of configuration spaces". Proceedings of the American Mathematical
Configuration space (mathematics)
Configuration_space_(mathematics)
Measure of a graph's centrality, based on shortest paths
introduction by ego). Betweenness centrality has been used to analyze the topological complexity of river networks as well as their use in maritime trade. Betweenness
Betweenness_centrality
1950 short story by Armin Joseph Deutsch
himself, he believes that the new shuttle connection caused the topological complexity of the system to increase to the point where the connectivity became
A_Subway_Named_Mobius
Mathematical theory
onto. Similar to stochastic closure, the full picture of a curve's topological complexity must be determined by sampling the knotoids of many projections
Open_knot_theory
Type of quantum computer
processors, the first used a toric code with twist defects as a topological degeneracy (or topological defect) while the second used a different but related protocol
Topological_quantum_computer
Russian-American physicist (born 1963)
contributed to the classification of topological phases. He related two-dimensional lattice models of topological order to algebraic data describing the
Alexei_Kitaev
Notion in combinatorial game theory
Combinatorial game theory measures game complexity in several ways: State-space complexity (the number of legal game positions from the initial position)
Game_complexity
Field of mathematics and science based on non-linear systems and initial conditions
evolves chaotically with non-periodic behavior. Topological mixing (or the weaker condition of topological transitivity) means that the system evolves over
Chaos_theory
Observation in computer circuit design
the interconnection complexity of a circuit. Higher (intrinsic) Rent exponent values correspond to a higher topological complexity. One extreme example
Rent's_rule
Result on the topology of operators on an infinite-dimensional, complex Hilbert space
is that passing to infinitely many dimensions causes much of the topological complexity of the unitary groups to vanish; but see the section on Bott's unitary
Kuiper's_theorem
Function that counts distinct factors of a string
exists as the logarithm of the complexity function is subadditive. Every real number between 0 and 1 occurs as the topological entropy of some sequence is
Complexity_function
Type of spatial relationship
POLYVRT (Harvard University, 1976). The strategy of the topological data model is to store topological relationships (primarily adjacency) between features
Geospatial_topology
Topics referred to by the same term
algebraic structure Simplicial complex, a kind of topological space CW complex, a kind of topological space Line complex, a 3-dimensional family of lines
Complex
Analysis of datasets using techniques from topology
In applied mathematics, topological data analysis (TDA) is an approach to the analysis of datasets using techniques from topology. Extraction of information
Topological_data_analysis
Topological quantum error correcting code
quantum double models. It is also the simplest example of topological order—Z2 topological order (first studied in the context of Z2 spin liquid in 1991)
Surface_code
Computational complexity of quantum algorithms
Quantum complexity theory is the subfield of computational complexity theory that deals with complexity classes defined using quantum computers, a computational
Quantum_complexity_theory
Italian-British applied mathematician
in particular) and structural complexity. He is known for his contributions to the field of geometric and topological fluid dynamics and, in particular
Renzo_L._Ricca
Computational complexity class of problems
In computational complexity theory, bounded-error quantum polynomial time (BQP) is the class of decision problems solvable by a quantum computer in polynomial
BQP
Mathematical description of mixing substances
definitions for mixing exist, including strong mixing, weak mixing and topological mixing, with the last not requiring a measure to be defined. Some of
Mixing_(mathematics)
Computer hardware technology that uses quantum mechanics
using superconducting electronic circuits. Topological quantum computer — proposed approach using topological states such as anyons. Trapped-ion quantum
Quantum_computing
Fewest graph edges whose removal breaks all cycles
of a topological space derived from the graph. It counts the ears in an ear decomposition of the graph, forms the basis of parameterized complexity on almost-trees
Cyclomatic_number
Data structure used for indexing spatial information
leaf page. Leaf pages overlap little, but directory pages do. R*-tree topological split. The pages overlap very little since the R*-tree tries to minimize
R*-tree
peptide's N-terminus to form the knot. (Some lasso peptides also have topological complexity conferred by disulfide bonds.) Isopeptidase enzymes linearize the
Isopeptidase
Unsolved problem in computational complexity theory
time nor to be NP-complete, and therefore may be in the computational complexity class NP-intermediate. It is known that the graph isomorphism problem
Graph_isomorphism_problem
Complexity class
computational complexity theory, the class QIP (which stands for Quantum Interactive Proof) is the quantum computing analogue of the classical complexity class
QIP_(complexity)
Mathematical structure
topological manifold with some additional mathematical structure that allows for differential calculus on the manifold. If M is already a topological
Differential_structure
Infinitely detailed mathematical structure
curve map is not a homeomorphism, so it does not preserve topological dimension. The topological dimension and Hausdorff dimension of the image of the Hilbert
Fractal
Concept in math
other categories in geometry and algebra. The category of topological spaces Top has topological spaces as objects and as morphisms the continuous maps between
Homotopy_category
Algorithm to search the nodes of a graph
postorderings are A C B D and A B C D. Reverse postordering produces a topological sorting of any directed acyclic graph. This ordering is also useful in
Depth-first_search
Pathological embedding of the sphere in 3D space
3-dimensional Euclidean space. The topological object was discovered by J. W. Alexander (1924). It is a particular topological embedding of a two-dimensional
Alexander_horned_sphere
Quantum computational theorem on problem complexity
no low-energy trivial state (NLTS) conjecture is a lower bound on the complexity of certain classes of quantum states which was conjectured by Michael
NLTS_conjecture
Real-valued number of spatial dimensions
dimension of a set exceeds its topological dimension, the set is considered to have fractal geometry. Unlike topological dimensions, the fractal index
Fractal_dimension
Mathematical set with some added structure
linear and topological structures underlie the linear topological space (in other words, topological vector space) structure. A linear topological space is
Space_(mathematics)
Study of discrete mathematical structures
metric spaces, there are more general discrete topological spaces, finite metric spaces, finite topological spaces. The time scale calculus is a unification
Discrete_mathematics
Associative array for storing key–value pairs
probing sequence. In a well-dimensioned hash table, the average time complexity for each lookup is independent of the number of elements stored in the
Hash_table
Tool to track locally defined data attached to the open sets of a topological space
and even if the sheaf F arises from a natural topological situation, E may not have any clear topological interpretation. For example, if F is the sheaf
Sheaf_(mathematics)
Computational Complexity, 8 (4): 316–329, doi:10.1007/s000370050002, S2CID 10641238. Ben-Amram, Amir M.; Galil, Zvi (2001), "Topological Lower Bounds on
Element_distinctness_problem
Theory of stochastic partial differential equations
inherent topological supersymmetry (TS) enabling the generalization of certain concepts from deterministic to stochastic models. Using tools of topological field
Supersymmetric theory of stochastic dynamics
Supersymmetric_theory_of_stochastic_dynamics
Conjecture in computational complexity theory
In computational complexity theory, the unique games conjecture (often referred to as UGC) is a conjecture made by Subhash Khot in 2002, that it is NP-hard
Unique_games_conjecture
Maximal subgraph whose vertices can reach each other
sets. Just as the number of connected components of a topological space is an important topological invariant, the zeroth Betti number, the number of components
Component_(graph_theory)
Quantum analog of probabilistic automata
The behaviour of topological automata is studied in the field of topological dynamics. The quantum automaton differs from the topological automaton in that
Quantum_finite_automaton
Graph algorithm
the strongly connected components are identified constitutes a reverse topological sort of the DAG formed by the strongly connected components. Donald Knuth
Tarjan's strongly connected components algorithm
Tarjan's_strongly_connected_components_algorithm
Flat-sided three-dimensional shape
notions form the basis of topological definitions of polyhedra, as subdivisions of a topological manifold into topological disks (the faces) whose pairwise
Polyhedron
Problem in combinatorial optimization
1016/0196-6774(82)90002-5. ISSN 0196-6774. Ben-Amram, Amir M.; Galil, Zvi (2001), "Topological Lower Bounds on Algebraic Random Access Machines", SIAM Journal on Computing
Knapsack_problem
Complexity class
number of satisfying assignments. Topologically sorting is easy in contrast to counting the number of topological sortings. A single perfect matching
♯P-complete
Quantum Computing Division/Software
chip powered by a topological core architecture. The work created a new class of materials called topoconductors, which use topological superconductivity
Microsoft_Azure_Quantum
Unsolved problem on graph query complexity
conjecture has been resolved for the case where n is a prime power using a topological approach. The conjecture has also been resolved for all non-trivial monotone
Aanderaa–Karp–Rosenberg conjecture
Aanderaa–Karp–Rosenberg_conjecture
Stage of electronic circuit design
gEDA suite) TopRouter (the topological pre-router in CadSoft/Autodesk's EAGLE 7.0 and higher) SimplifyPCB (a topological router with a focus on bundle
Routing (electronic design automation)
Routing_(electronic_design_automation)
Structural complexity is a science of applied mathematics that aims to relate fundamental physical or biological aspects of a complex system with the mathematical
Structural complexity (applied mathematics)
Structural_complexity_(applied_mathematics)
Attribute of machine learning models
The sample complexity of a machine learning algorithm represents the number of training-samples that it needs in order to successfully learn a target function
Sample_complexity
Graph layout on multiple half-planes
include abstract algebra and knot theory. The notion of a book, as a topological space, was defined by C. A. Persinger and Gail Atneosen in the 1960s
Book_embedding
the mean (topological) dimension of a topological dynamical system is a non-negative extended real number that is a measure of the complexity of the system
Mean_dimension
Method for solving one problem using another
nontrivial problem, see p. 48. Schaefer, Marcus (2010), "Complexity of some geometric and topological problems" (PDF), Graph Drawing, 17th International Symposium
Polynomial-time_reduction
Algorithm to be run on quantum computers
quantum Fourier transform, quantum walks, amplitude amplification and topological quantum field theory. Quantum algorithms may also be grouped by the type
Quantum_algorithm
Quantum algorithm
Bernstein–Vazirani algorithm was designed to prove an oracle separation between complexity classes BQP and BPP. Given an oracle that implements a function f : {
Bernstein–Vazirani_algorithm
Topics referred to by the same term
number of lighthouse Fresnel lenses, defining size and focal length Topological order in quantum mechanics, an organized quantum state First-order hold
Order
Property of functions which is weaker than continuity
function f:X→ℕ on an arbitrary topological space X is locally constant on some dense open subset of X. If the topological space X is sequential, then f:X→ℝ
Semi-continuity
Subfield of mathematical topology
Computable topology (the study of the topological nature of computation) Computational geometry Digital topology Topological data analysis Spatial-temporal reasoning
Computational_topology
Additional mathematical object
features are compatible in a certain way, then the structure becomes a topological group. A map between two similarly-structured sets that preserves their
Mathematical_structure
Computational benchmark
engineering task of building a powerful quantum computer and the computational-complexity-theoretic task of finding a problem that can be solved by that quantum
Quantum_supremacy
Fewest edge crossings in drawing of a graph
1137/120872310. S2CID 6535755. Schaefer, Marcus (2010). Complexity of some geometric and topological problems (PDF). Graph Drawing, 17th International Symposium
Crossing number (graph theory)
Crossing_number_(graph_theory)
Gives conditions that guarantee the max–min inequality holds with equality
Let X be a convex subset of a linear topological space and let Y be a compact convex subset of a linear topological space. If f is a real-valued function
Minimax_theorem
Embedding a graph in a topological space, often Euclidean
cellular embeddings include the ribbon graph, a topological space formed by gluing together topological disks for the vertices and edges of an embedded
Graph_embedding
Computational problem
reductions. Note that, in terms of time complexity, it can be solved in linear time simply by a topological sort. The Boolean formula value problem (or
Circuit_value_problem
Natural interconnection of food chains
web networks. Ecologists have identified non-random properties in the topological structure of food webs. Published examples that are used in meta analysis
Food_web
Basic unit of quantum information
up gapped topological system non-abelian anyons braiding of excitations depends on specific topological system depends on specific topological system vibrational
Qubit
Class of algorithms which use a moving line to solve geometrical problems
algorithm) and the Delaunay triangulation or boolean operations on polygons. Topological sweeping is a form of plane sweep with a simple ordering of processing
Sweep_line_algorithm
Branch of mathematics
distinction when needed. Just as continuous functions are the natural maps on topological spaces and smooth functions are the natural maps on differentiable manifolds
Algebraic_geometry
Smallest convex set containing a given set
hulls, the upward-facing and downward-facing parts of the boundary form topological disks. The closed convex hull of a set is the closure of the convex hull
Convex_hull
Type of shift space studied in ergodic theory
shifts of finite type. Subshifts of finite type are also sometimes called topological Markov shifts. Many chaotic dynamical systems are isomorphic to subshifts
Subshift_of_finite_type
Roughly, the number of k-dimensional holes on a topological surface
The same definition applies to any topological space which has a finitely generated homology. Given a topological space which has a finitely generated
Betti_number
Topological model
The Dimensionally Extended 9-Intersection Model (DE-9IM) is a topological model and a standard used to describe the spatial relations of two regions (two
DE-9IM
2026 release of AI-generated mathematical solutions
fifth problem: every locally compact topological group acting continuously and faithfully on a connected topological manifold is claimed to be a Lie group
OpenAI bulk release of mathematical papers
OpenAI_bulk_release_of_mathematical_papers
Copy of a directed graph with redundant edges removed
Garey & Ullman (1972), who provided tight bounds on the computational complexity of constructing them. More technically, the reduction is a directed graph
Transitive_reduction
Quantum Merlin Arthur
abbreviation for Quantum Merlin Arthur, refers to a complexity class in computational complexity theory. It is the set of all formal languages that satisfy
QMA
Particle
entirely on braiding and performing topological charge measurements, and hence form a natural setting for topological quantum computing. This is in contrast
Fibonacci_anyons
Principle in statistical learning theory
minimization given a fixed function class can be derived using bounds on the VC complexity of the function class. For simplicity, considering the case of binary
Empirical_risk_minimization
Three-holed sphere
construct the Fenchel-Nielsen coordinates on Teichmüller space, and in topological quantum field theory where they are the simplest non-trivial cobordisms
Pair_of_pants_(mathematics)
Set of objects whose state must satisfy limits
problems of many seemingly unrelated families. CSPs often exhibit high complexity, requiring a combination of heuristics and combinatorial search methods
Constraint satisfaction problem
Constraint_satisfaction_problem
Computer science
In computational complexity theory, exact quantum polynomial time (EQP or sometimes QP) is the class of decision problems that can be solved by a quantum
Exact_quantum_polynomial_time
Swarming behaviour of birds when flying or foraging
where it was shown that Starlings typically interact with at most seven topological neighbors. Improvements: Spatial subdivision. The entire area/volume
Flocking
Method of finding a directed graph's strongly connected components
pass groups vertices into one contiguous block per strongly connected component. The blocks themselves will be arranged in a topologically sorted order.
Kosaraju's_algorithm
Proof method
Kolmogorov complexity theory, named for Andrey Kolmogorov. One of the first uses of the incompressibility method with Kolmogorov complexity in the theory
Incompressibility_method
Numerical method that reduces the complexity of computationally intensive simulations
orthogonal decomposition is a numerical method that enables a reduction in the complexity of computer intensive simulations such as computational fluid dynamics
Proper orthogonal decomposition
Proper_orthogonal_decomposition
Complexity class
In computational complexity theory, PostBQP is a complexity class consisting of all of the computational problems solvable in polynomial time on a quantum
PostBQP
travel, tourism, insurance
TOPOLOGICAL COMPLEXITY
TOPOLOGICAL COMPLEXITY
TOPOLOGICAL COMPLEXITY
TOPOLOGICAL COMPLEXITY
TOPOLOGICAL COMPLEXITY
TOPOLOGICAL COMPLEXITY
TOPOLOGICAL COMPLEXITY
TOPOLOGICAL COMPLEXITY
TOPOLOGICAL COMPLEXITY
travel, tourism, insurance