Searches , social queries for PROBLEM FINDING
Search references for PROBLEM FINDING. Phrases containing PROBLEM FINDING
See searches and references containing PROBLEM FINDING!
Search references for PROBLEM FINDING. Phrases containing PROBLEM FINDING
See searches and references containing PROBLEM FINDING!PROBLEM FINDING
Problem discovery
used for problem finding in literature including problem discovery, problem formulation, problem identification, problem construction, and problem posing
Problem_finding
Computational problem of graph theory
In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights
Shortest_path_problem
The claw finding problem is a classical problem in complexity theory, with several applications in cryptography. In short, given two functions f, g, viewed
Claw_finding_problem
Mental process of problem solving
solution. The process of creative problem-solving usually begins with defining the problem. This may lead to finding a simple non-creative solution, a
Creative_problem-solving
Task of computing complete subgraphs
In computer science, the clique problem is the computational problem of finding cliques (subsets of vertices, all adjacent to each other, also called
Clique_problem
Process of achieving a goal by overcoming obstacles
to problems encountered in life. Solutions to these problems are usually situation- or context-specific. The process starts with problem finding, in
Problem_solving
Finding strings that approximately match a pattern
searching) is the technique of finding strings that match a pattern approximately (rather than exactly). The problem of approximate string matching is
Approximate_string_matching
Problem of finding the best feasible solution
economics, an optimization problem is the problem of finding the best solution from all feasible solutions. Optimization problems can be divided into two
Optimization_problem
Complexity class
consequence, finding a polynomial time algorithm to solve a single NP-hard problem would give polynomial time algorithms for all the problems in the complexity
NP-hardness
Set of edges without common vertices
one edge of that matching. Finding a largest matching in a bipartite graph can be treated as a network flow problem. Finding a largest matching in a general
Matching_(graph_theory)
Probability of shared birthdays
birthday problem include a cryptographic attack called the birthday attack, which uses this probabilistic model to reduce the complexity of finding a collision
Birthday_problem
Problem of finding the longest simple path for a given graph
theory and theoretical computer science, the longest path problem is the problem of finding a simple path of maximum length in a given graph. A path is
Longest_path_problem
Type of problem involving ODEs or PDEs
earliest boundary value problems to be studied is the Dirichlet problem, of finding the harmonic functions (solutions to Laplace's equation); the solution
Boundary_value_problem
American animated television series
The Problem Solverz is an American animated television series created by Ben Jones for Cartoon Network. It follows Alfe, Roba, and Horace; a group of
The_Problem_Solverz
Choosing the fewest coins to make a given amount of money
The change-making problem addresses the question of finding the minimum number of coins (of certain denominations) that add up to a given amount of money
Change-making_problem
Quantum algorithm for integer factorization
similar algorithms for solving the factoring problem, the discrete logarithm problem, and the period-finding problem. "Shor's algorithm" usually refers to the
Shor's_algorithm
Combinatorial optimization problem
minimized. Alternatively, describing the problem using graph theory: The assignment problem consists of finding, in a weighted bipartite graph, a matching
Assignment_problem
Mapping a graph onto itself without changing edge-vertex connectivity
{\displaystyle c>0} . Consequently, like the graph isomorphism problem, the problem of finding a graph's automorphism group is known to belong to the complexity
Graph_automorphism
Complexity class of problems
hypothesis, there exist natural problems that require quasi-polynomial time, and can be solved in that time, including finding a large disjoint set of unit
NP-intermediate
Computational problem in graph theory
maximum flow problems involve finding a feasible flow through a flow network that obtains the maximum possible flow rate. The maximum flow problem can be seen
Maximum_flow_problem
Problem of determining if a Boolean formula could be made true
computer science, the Boolean satisfiability problem (sometimes called propositional satisfiability problem and abbreviated SATISFIABILITY, SAT or B-SAT)
Boolean satisfiability problem
Boolean_satisfiability_problem
Problems in mathematics concerning chessboard or the sport chess
studied mathematical chess problems, such as, Thabit, Euler, Legendre and Gauss. Besides finding a solution to a particular problem, mathematicians are usually
Mathematical_chess_problem
activities are carried out in the organization: Problem Finding and acquisition Problem Solving Choice of problem solution Execution of solution Control and
Value_shop
Problem-solving method
used in everything from matching nuts and bolts to finding the values of variables in algebra problems. In mathematics, some common heuristics involve the
Heuristic
Problem of finding a cycle through all vertices of a graph
NP-Completeness and Richard Karp's list of 21 NP-complete problems. The problems of finding a Hamiltonian path and a Hamiltonian cycle can be related
Hamiltonian_path_problem
Unsolved problem in computer science
Unsolved problem in computer science If the solution to a problem can be verified in polynomial time, must the problem be solvable in polynomial time
P_versus_NP_problem
2004 historical drama film by Marc Forster
Finding Neverland is a 2004 biographical drama film, directed by Marc Forster and written by David Magee, based on the 1998 play The Man Who Was Peter
Finding_Neverland_(film)
Unrelated vertices in graphs
. The optimization problem of finding such a set is called the maximum independent set problem. It is a strongly NP-hard problem. As such, it is unlikely
Independent set (graph theory)
Independent_set_(graph_theory)
Graph without triples of adjacent vertices
bipartition are as equal as possible. The triangle finding or triangle detection problem is the problem of determining whether a graph is triangle-free or
Triangle-free_graph
Very general problem in computer science
shortest vector problem. This makes it especially important in the theory of quantum computing because Shor's algorithms for factoring and finding discrete logarithms
Hidden_subgroup_problem
String in combinatorial math
superpermutation, and the problem of finding the path with the smallest weight becomes a form of the traveling salesman problem. The first instance of a
Superpermutation
is a matching). Finding the global minimum solution of a Hartree-Fock problem Upward planarity testing Hospitals-and-residents problem with couples Knot
List_of_NP-complete_problems
Logic puzzle
As a computational problem, finding a solution to a given Numberlink puzzle is NP-complete, for the versions in which the problem is only to connect all
Numberlink
Problem-solving tools
the characteristics of the problems which these inventions have overcome. The research produced three findings: Problems and solutions are repeated across
TRIZ
Instructional strategy and a type of blended learning
higher-order thinking skills such as problem-finding, collaboration, design and problem solving as students tackle difficult problems, work in groups, research,
Flipped_classroom
Physics problem related to laws of motion and gravity
In physics, specifically classical mechanics, the three-body problem is to take the initial positions and velocities (or momenta) of three point masses
Three-body_problem
2008 American film
Finding Amanda is a 2008 comedy drama film directed by Peter Tolan and starring Matthew Broderick and Brittany Snow. The plot revolves around a television
Finding_Amanda
Partition of a graph's nodes into cliques
problem in computational complexity theory is the algorithmic problem of finding a minimum clique cover, or (rephrased as a decision problem) finding
Clique_cover
Problem of grouping into triples
well-known computational problem: finding a largest 3-dimensional matching in a given hypergraph. 3DM is one of the first problems that were proved to be
3-dimensional_matching
American sci-fi television series
movements, and liberal viewers finding the scenes as a warning against conservative populism and Denialism. "3 Body Problem Cast and Character Guide". Netflix
3_Body_Problem_(TV_series)
Problem that is difficult or impossible to solve
In planning and policy, a wicked problem is a problem that is difficult or impossible to solve because of incomplete, contradictory, and changing requirements
Wicked_problem
Measurement of the direction from which a received signal was transmitted
Direction finding (DF), radio direction finding (RDF), or radiogoniometry is the use of radio waves to determine the direction to a radio source. The
Direction_finding
Mathematical optimization problem
of flow through a flow network. A typical application of this problem involves finding the best delivery route from a factory to a warehouse where the
Minimum-cost_flow_problem
Probability puzzle
The Monty Hall problem is a brain teaser, in the form of a probability puzzle, based nominally on the American television game show Let's Make a Deal
Monty_Hall_problem
Computer science problem
longest repeated substring problem is the problem of finding the longest substring of a string that occurs at least twice. This problem can be solved in linear
Longest repeated substring problem
Longest_repeated_substring_problem
Finding shortest walks through all graph edges
strongly connected. Various combinatorial problems have been reduced to the Chinese Postman Problem, including finding a maximum cut in a planar graph and a
Chinese_postman_problem
Type of stable matching problem
combinatorial game theory and algorithms, the stable-roommate problem (SRP) is the problem of finding a stable matching for an even-sized set. A matching is
Stable_roommates_problem
Concept in modular arithmetic
In number theory, given a positive integer n and an integer a coprime to n, the multiplicative order of a modulo n is the smallest positive integer k such
Multiplicative_order
Set of all vertices of minimum eccentricity
1-center problem and can be extended to the vertex k-center problem. Finding the center of a graph is useful in facility location problems where the
Graph_center
Mathematical problem set on a chessboard
knight's tour problem is the mathematical problem of finding a knight's tour. Creating a program to find a knight's tour is a common problem given to computer
Knight's_tour
Topics referred to by the same term
marriage problem may refer to: Assignment problem, consisting of finding a maximum weight matching in a weighted bipartite graph Secretary problem, also
Marriage_problem
Mathematical problem
is 1. The Hadwiger–Nelson problem is to find the chromatic number of G. As a consequence, the problem is often called "finding the chromatic number of the
Hadwiger–Nelson_problem
points is less than or equal to t. The kissing number problem may be stated as the problem of finding the maximal N for a given n for which a spherical code
Spherical_code
In mathematics, the Hurwitz problem (named after Adolf Hurwitz) is the problem of finding multiplicative relations between quadratic forms which generalise
Hurwitz_problem
NP-hard problem in combinatorial optimization
that deliver approximated solutions in a reasonable time. Finding special cases for the problem ("subproblems") for which either better or exact heuristics
Travelling_salesman_problem
American psychologist (1940–2006)
Cults and Abusive Relationships. His article "A Big Mental Health Problem: Finding a Compatible Therapist" in The Advocate was cited by the Institute
Jesse_S._Miller
Graph theory concept
than k? This is also known as the degree-constrained spanning tree problem. Finding the minimum degree spanning tree of an undirected graph is NP-hard
Minimum_degree_spanning_tree
Problem in graph theory
edges between S and T is as large as possible. Finding such a cut is known as the max-cut problem. The problem can be stated simply as follows. One wants
Maximum_cut
Algorithms for zeros of functions
In numerical analysis, a root-finding algorithm is an algorithm for finding zeros, also called roots, of a function. A root of the function f is a number
Root-finding_algorithm
Design practice critically concerned with future designs
understanding of design as a problem-solving activity. In contrast, speculative design is concerned with problem finding. It does not create functional
Speculative_design
Topics referred to by the same term
operations research, the Fermat–Weber problem is either of two closely related problems: Geometric median, the problem of finding a point minimizing the sum of
Fermat–Weber_problem
Techniques used to model a situation to be changed
Method engineering Participatory modeling Policy § Policy cycle Problem finding Problem formulation Research question Richards Heuer § Structured analytic
Problem_structuring_methods
Subset of a graph's edges
cover problem is the problem of finding an edge cover of minimum size. It is an optimization problem that belongs to the class of covering problems and
Edge_cover
On finding a repeating loop in a sequence
In computer science, cycle detection or cycle finding is the algorithmic problem of finding a cycle in a sequence of iterated function values. For any
Cycle_detection
Technique for drawing non-planar graphs
possible. Unfortunately, finding the planar subgraph with the maximum possible number of edges (the maximum planar subgraph problem) is NP-hard, and MaxSNP-hard
Planarization
Least-weight tree connecting graph vertices
Since they run in polynomial time, the problem of finding such trees is in FP, and related decision problems such as determining whether a particular
Minimum_spanning_tree
Operations research problem, paradigm of constrained scheduling problems
The nurse scheduling problem (NSP), also called the nurse rostering problem (NRP), is the operations research problem of finding an optimal way to assign
Nurse_scheduling_problem
Processes by which design concepts are developed
thinking includes activities such as context analysis, user testing, problem finding and framing, ideation and solution generating, creative thinking, sketching
Design_thinking
Computational complexity class
edges fail with given independent probabilities. More strongly, the problem of finding an approximate Nash equilibrium has a QPTAS, but cannot have a PTAS
Quasi-polynomial_time
Mathematical question
Clock angle problems are a type of mathematical problem which involve finding the angle between the hands of an analog clock. Clock angle problems relate two
Clock_angle_problem
Area of discrete mathematics
all subgraphs have it too. Finding maximal subgraphs of a certain kind is often an NP-complete problem. For example: Finding the largest complete subgraph
Graph_theory
Subset of a graph's vertices, including at least one endpoint of every edge
the graph. In computer science, the problem of finding a minimum vertex cover is a classical optimization problem. It is NP-hard, so it cannot be solved
Vertex_cover
Complexity class
contains many natural problems that are of interest to computer scientists. These problems include integer factorization, finding a Nash equilibrium of
TFNP
Mathematical problem involving optimal stopping theory
known as the marriage problem, the sultan's dowry problem, the fussy suitor problem, the googol game, and the best choice problem. Its solution is also
Secretary_problem
Book by Karl Philipp Moritz
beggar or a thief. For this reason, Moritz experienced considerable problems finding room and board, and was even run out of some villages, simply for arriving
Journeys of a German in England in 1782
Journeys_of_a_German_in_England_in_1782
Unsolved problem in computational complexity theory
Unsolved problem in computer science Can the graph isomorphism problem be solved in polynomial time? More unsolved problems in computer science The graph
Graph_isomorphism_problem
Category of routing problem minimizing total distance and time
order, starting and ending at a depot. The Chinese postman problem (CPP) is aimed at finding the minimum length cycle for a single postman. The CPP requires
Arc_routing
of order 4 k {\displaystyle 4k} exists. Williamson conjecture: the problem of finding Williamson matrices, which can be used to construct Hadamard matrices
List of unsolved problems in mathematics
List_of_unsolved_problems_in_mathematics
Cryptographic hash function
oracles, finding a collision in MuHASH implies solving the discrete logarithm problem. MuHASH is thus a provably secure hash, i.e. we know that finding a collision
Elliptic_curve_only_hash
Problem in combinatorial optimization
NP-complete problems. Knapsack problems appear in real-world decision-making processes in a wide variety of fields, such as finding the least wasteful way to
Knapsack_problem
On short connecting nets with added points
terminals, it reduces to finding the shortest path. If, on the other hand, all vertices are terminals, the Steiner tree problem in graphs is equivalent
Steiner_tree_problem
Problem in geometry
In geometry, the napkin-ring problem involves finding the volume of what remains after a circular hole is drilled through a sphere. Specifically, the hole
Napkin_ring_problem
On areas of shapes in 2d motion planning
mathematics, the moving sofa problem or sofa problem is a two-dimensional idealization of real-life furniture-moving problems and asks for the rigid two-dimensional
Moving_sofa_problem
British metal band
formed in late 2011 by guitarist Daniel Finch. The band experienced problems finding a stable vocalist until Dani Filth from the extreme metal band Cradle
Devilment
Problem in computational geometry
In computational geometry, the largest empty sphere problem is the problem of finding a hypersphere of largest radius in d-dimensional space whose interior
Largest_empty_sphere
American filmmaker and animator (born 1965)
the director and co-writer of the Pixar animated films Finding Nemo (2003), WALL-E (2008), Finding Dory (2016), and Toy Story 5 (2026). He also directed
Andrew_Stanton
Finding the roots of polynomials is a long-standing problem that has been extensively studied throughout the history and substantially influenced the
Polynomial_root-finding
Largest independent set of paired elements
In combinatorial optimization, the matroid parity problem is a problem of finding the largest independent set of paired elements in a matroid, a structure
Matroid_parity_problem
Problem in computer science
computer science, the maximum sum subarray problem, also known as the maximum segment sum problem, is the task of finding a contiguous subarray with the largest
Maximum_subarray_problem
Graph which remains connected when fewer than k edges are removed
O ( n 2 log 3 n ) {\displaystyle O(n^{2}\log ^{3}n)} . A related problem: finding the minimum k-edge-connected spanning subgraph of G (that is: select
Edge_connectivity
Pathfinding problem
already computed their plans. Finding a solution for the MAPF problem in such setting corresponds to the shortest path problem in a time-expansion graph.
Multi-agent_pathfinding
of the Sardinas–Patterson algorithm to show that the complementary problem, finding a string that has multiple ambiguous decodings, belongs to NL. Because
NL-complete
Algebra whose elements are stable matchings
matchings. The problem of finding the minimum or maximum weight stable matching becomes in this way equivalent to the problem of finding the minimum or
Lattice_of_stable_matchings
Study of optimal transportation and allocation of resources
case of the transportation problem is an instance of the assignment problem. More specifically, it is equivalent to finding a minimum weight matching in
Transportation theory (mathematics)
Transportation_theory_(mathematics)
Computational problem in graph theory
set of vertices C, such that no edges leave C. The closure problem is the task of finding the maximum-weight or minimum-weight closure in a vertex-weighted
Closure_problem
Logic problem, AND of pairwise ORs
complicated forms of the satisfiability problem. A computationally difficult variation of 2-satisfiability, finding a truth assignment that maximizes the
2-satisfiability
Algorithm for the multi-armed bandit problem
multi-armed bandit problem focused on finding the best trade-off between exploration and exploitation. The multi-armed bandit problem is a sequential game
Explore-then-commit_algorithm
Estimate of time taken for running an algorithm
time" does not mean the running time must be entirely independent of the problem size; rather, it should have a consistent upper bound irrespective of input
Time_complexity
Computing problem
interest since finding the median has several applications. On the other hand, the median problem, a special case of the selection problem, is solvable
Range query (computer science)
Range_query_(computer_science)
Philosophical question
In philosophy of religion, the problem of evil, also known as the problem of suffering, is the philosophical question of how to reconcile the existence
Problem_of_evil
travel, tourism, insurance
PROBLEM FINDING
PROBLEM FINDING
PROBLEM FINDING
PROBLEM FINDING
PROBLEM FINDING
PROBLEM FINDING
PROBLEM FINDING
PROBLEM FINDING
PROBLEM FINDING
travel, tourism, insurance