Problem finding means problem discovery. It is part of the larger problem process that includes problem shaping and problem solving. Problem finding requires...

In computer science, the clique problem is the computational problem of finding cliques (subsets of vertices, all adjacent to each other, also called...

The claw finding problem is a classical problem in complexity theory, with several applications in cryptography. In short, given two functions f, g, viewed...

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...

personal problem solving. Each concerns some difficulty or barrier that is encountered. Problem solving in psychology refers to the process of finding solutions...

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...

economics, an optimization problem is the problem of finding the best solution from all feasible solutions. Optimization problems can be divided into two...

searching) is the technique of finding strings that match a pattern approximately (rather than exactly). The problem of approximate string matching is...

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...

of the larger problem process that includes problem finding and problem solving. Problem shaping (or problem framing) often involves the application of...

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...

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...

minimized. Alternatively, describing the problem using graph theory: The assignment problem consists of finding, in a weighted bipartite graph, a matching...

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...

higher-order thinking skills such as problem-finding, collaboration, design and problem solving as students tackle difficult problems, work in groups, research,...

birthday problem include a cryptographic attack called the birthday attack, which uses this probabilistic model to reduce the complexity of finding a collision...

strongly connected. Various combinatorial problems have been reduced to the Chinese Postman Problem, including finding a maximum cut in a planar graph and a...

studied mathematical chess problems, such as, Thabit, Euler, Legendre and Gauss. Besides finding a solution to a particular problem, mathematicians are usually...

earliest boundary value problems to be studied is the Dirichlet problem, of finding the harmonic functions (solutions to Laplace's equation); the solution...

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...

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...

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...

wicked problems; Russell Ackoff called them "messes". Bold hypothesis Design of experiments Hypothesis Inquiry Research design Problem finding Problem shaping...

case of the transportation problem is an instance of the assignment problem. More specifically, it is equivalent to finding a minimum weight matching in...

used in everything from matching nuts and bolts to finding the values of variables in algebra problems. In mathematics, some common heuristics involve the...

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...

Direction finding (DF), or radio direction finding (RDF), is the use of radio waves to determine the direction to a radio source. The source may be a cooperating...

{\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...

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...

Expertise finding is the use of tools for finding and assessing individual expertise. In the recruitment industry, expertise finding is the problem of searching...