AI & ChatGPT searches , social queries for PROBLEM STATEMENT
Search references for PROBLEM STATEMENT. Phrases containing PROBLEM STATEMENT
See searches and references containing PROBLEM STATEMENT!
Search references for PROBLEM STATEMENT. Phrases containing PROBLEM STATEMENT
See searches and references containing PROBLEM STATEMENT!PROBLEM STATEMENT
Description of an issue
problem statement is a description of an issue to be addressed, or a condition to be improved upon. It identifies the gap between the current problem
Problem_statement
Combinatorial optimization problem
distances multiplied by the corresponding flows. The problem statement resembles that of the assignment problem, except that the cost function is expressed in
Quadratic_assignment_problem
Philosophical thought experiment about utility
In philosophy, Pascal's mugging is a thought experiment demonstrating a problem in expected utility maximization. A rational agent should choose actions
Pascal's_mugging
Classic problem in graph theory
mainland portions of the city—Altstadt and Vorstadt—by seven bridges. The problem was to devise a walk through the city that would cross each of those bridges
Seven_Bridges_of_Königsberg
Seven mathematical problems with a US$1 million prize for each solution
cohomology classes of complex subvarieties of X. The official statement of the problem was given by Pierre Deligne. ∂ u ∂ t ⏟ Variation + ( u ⋅ ∇ ) u
Millennium_Prize_Problems
Very general problem in computer science
hidden subgroup problem (HSP) is a topic of research in mathematics and theoretical computer science. It is a generalization of problems including factoring
Hidden_subgroup_problem
Control flow construct for executing code repeatedly
called infinite loops. The problem of determining whether a program contains an infinite loop is known as the halting problem. A conditional loop (also
Loop_(statement)
Resolved problem in plane geometry
Hermann Rothe, and Roland Weitzenböck. A generalization of this problem statement was answered in the negative in 1997 by Marek R. Rychlik. An equichordal
Equichordal_point_problem
Millennium Prize Problem
providing a solution for a specific statement of the problem: Prove or give a counter-example of the following statement: In three space dimensions and time
Navier–Stokes existence and smoothness
Navier–Stokes_existence_and_smoothness
On Schubert's enumerative calculus
string theory. The entirety of the original problem statement, in English translation, is as follows: The problem consists in this: To establish rigorously
Hilbert's_fifteenth_problem
Problem in computer science
mathematically definable but not computable. A key part of the formal statement of the problem is a mathematical definition of a computer and program, usually
Halting_problem
Mathematical problem in number theory
Archimedes's cattle problem (or the problema bovinum or problema Archimedis) is a problem in Diophantine analysis, the study of polynomial equations with
Archimedes's_cattle_problem
Problem in continuous-time finance
Merton's portfolio problem is a problem in continuous-time finance and in particular intertemporal portfolio choice. An investor must choose how much to
Merton's_portfolio_problem
Approximation method in statistics
The linear least-squares problem occurs in statistical regression analysis; it has a closed-form solution. The nonlinear problem is usually solved by iterative
Least_squares
Paradox in probability theory
different assumptions can lead to different outcomes (because the problem statement was not well enough defined to allow a single straightforward interpretation
Boy_or_girl_paradox
project charter The project owner, sponsors, and stakeholders The problem statement The project goals and objectives The project requirements A bill of
Scope_statement
Unsolved problem in extremal graph theory
subgraphs of a given size? More unsolved problems in mathematics The Zarankiewicz problem, an unsolved problem in mathematics, asks for the largest possible
Zarankiewicz_problem
Philosophical problem articulated by David Hume
The is–ought problem is the question of whether moral statements about what ought to be can be inferred from objective statements about what is. It was
Is–ought_problem
Problem used to illustrate synchronization issues and techniques for resolving them
In computer science, the dining philosophers problem is an example problem often used in concurrent algorithm design to illustrate synchronization issues
Dining_philosophers_problem
Promotes work on calculus of variations
much a specific "problem" as an encouragement towards further development of the calculus of variations. His statement of the problem is a summary of the
Hilbert's twenty-third problem
Hilbert's_twenty-third_problem
Yes-or-no question that cannot ever be solved by a computer
consequence of the undecidability of the halting problem. This weaker form differs from the standard statement of the incompleteness theorem by asserting that
Undecidable_problem
Deterministic quantum algorithm
computer. Simon's problem is an example of a problem that yields an oracle separation between BQP and BPP. In the Deutsch–Jozsa problem, we are given a
Deutsch–Jozsa_algorithm
Type of numerical analysis
algorithm. Conversely, Best and Chakravarti studied the problem as an active set identification problem, and proposed a primal algorithm. These two algorithms
Isotonic_regression
Optimization algorithm
real-valued function. The Frank–Wolfe algorithm solves the optimization problem Minimize f ( x ) {\displaystyle f(\mathbf {x} )} subject to x ∈ D {\displaystyle
Frank–Wolfe_algorithm
Mathematical method for optimizing material layout under given conditions
(\rho ),\rho )\leq 0{\text{ with }}j=1,...,m.\end{aligned}}} The problem statement includes the following: An objective function F ( u ( ρ ) , ρ ) {\displaystyle
Topology_optimization
Process of achieving a goal by overcoming obstacles
philosophy of science Problem-posing education – Method of teaching coined by Paulo Freire Problem statement – Description of an issue Problem structuring methods –
Problem_solving
Can all boundary value problems be solved
variation problems in more than 1 dimension (for example, minimal surface problems or minimal curvature problems) The original problem statement in its entirety
Hilbert's_twentieth_problem
Axiomatization of probability and physics
sixth problem is to axiomatize those branches of physics in which mathematics is prevalent. It occurs on the widely cited list of Hilbert's problems in mathematics
Hilbert's_sixth_problem
Quantum algorithm
The Bernstein–Vazirani algorithm, which solves the Bernstein–Vazirani problem, is a quantum algorithm invented by Ethan Bernstein and Umesh Vazirani in
Bernstein–Vazirani_algorithm
Mathematical algorithm
+ by = gcd(a, b). The problem that can supposedly be solved by the Kuṭṭaka method was not formulated by Aryabhaṭa as a problem of solving the linear Diophantine
Kuṭṭaka
Problem in computer science
quantum computing, the hidden shift problem is a type of oracle-based problem. Various versions of this problem have quantum algorithms which can run
Hidden_shift_problem
Problem of determining whether polynomials are identical
In mathematics, polynomial identity testing (PIT) is the problem of efficiently determining whether two multivariate polynomials are identical. More formally
Polynomial_identity_testing
Planned operator–machine interaction
assessing matters from the target audience's viewpoint, defining a problem statement, ideating potential solutions, prototyping wireframes, and testing
User_interface_design
Method for finding kth smallest value
{\displaystyle k} th order statistic. Selection includes as special cases the problems of finding the minimum, median, and maximum element in the collection.
Selection_algorithm
Unsolved problem about inscribing a square in a Jordan curve
Unsolved problem in mathematics Does every Jordan curve have an inscribed square? More unsolved problems in mathematics The inscribed square problem, also
Inscribed_square_problem
On mathematics of sums of prime powers
The Waring–Goldbach problem is a problem in additive number theory, concerning the representation of integers as sums of powers of prime numbers. It is
Waring–Goldbach_problem
On uniformization of analytic relations
relations by means of automorphic functions. The entirety of the original problem statement is as follows: As Poincaré was the first to prove, it is always possible
Hilbert's twenty-second problem
Hilbert's_twenty-second_problem
Method of describing good design practices
the context description, the problem statement, a longer part of text with examples and explanations, a solution statement, a sketch and further references
Pattern_language
Search problem in quantum mechanics
hidden linear function problem, is a search problem that generalizes the Bernstein–Vazirani problem. In the Bernstein–Vazirani problem, the hidden function
Hidden linear function problem
Hidden_linear_function_problem
Statement which ends execution of a function and resumes in the main code
from the same sort of problems that arise for the GOTO statement. Conversely, it can be argued that using the return statement is worthwhile when the
Return_statement
Function used in optimal control theory
a problem of optimal control for a dynamical system. It can be understood as an instantaneous increment of the Lagrangian expression of the problem that
Hamiltonian_(control_theory)
theoretical computer science, the monochromatic triangle problem is an algorithmic problem on graphs, in which the goal is to partition the edges of
Monochromatic_triangle
Representation learning method
to be orthogonal, and they may be an over-complete spanning set. This problem setup also allows the dimensionality of the signals being represented to
Sparse_dictionary_learning
Problem of deciding whether an expression equals zero
or the method of zero estimates. It has no formal statement as such but refers to a general problem prevalent in transcendental number theory. Often proofs
Constant_problem
Mathematical problem of making a structure rigid
In the mathematics of structural rigidity, grid bracing is a problem of adding cross bracing to a rectangular grid to make it into a rigid structure.
Grid_bracing
Automated recognition of patterns and regularities in data
whether a given email is "spam"). Pattern recognition is a more general problem that encompasses other types of output as well. Other examples are regression
Pattern_recognition
Theoretical framework in physics
Millennium Prize Problems, concerns the well-defined existence of Yang–Mills theories as set out by the above axioms. The full problem statement is as follows
Quantum_field_theory
Post-secondary academic institution in Singapore
typically receive a problem statement from their lecturers at the start of each day before exploring the solutions to the problem in a group of three
Republic_Polytechnic
Fastest curve descent without friction
I shall publicly declare him worthy of praise Bernoulli wrote the problem statement as: Given two points A and B in a vertical plane, what is the curve
Brachistochrone_curve
Mathematics optimization problem
Clearly the first method is more efficient. With this information, the problem statement can be refined as "how to determine the optimal parenthesization of
Matrix_chain_multiplication
Problem in computer programming
a problem in programming of parser generators in which an optional else clause in an if–then(–else) statement can make nested conditional statements ambiguous
Dangling_else
the Skorokhod problem is the problem of solving a stochastic differential equation with a reflecting boundary condition. The problem is named after Anatoliy
Skorokhod_problem
Impossible task in computing
mathematics and computer science, the Entscheidungsproblem (German for 'decision problem'; pronounced [ɛntˈʃaɪ̯dʊŋspʁoˌbleːm]) is a challenge posed by David Hilbert
Entscheidungsproblem
Mathematics problem
The Hundred Fowls Problem is a problem first discussed in the fifth century CE Chinese mathematics text Zhang Qiujian suanjing (The Mathematical Classic
Hundred_Fowls_Problem
Physics problem related to laws of motion and gravity
three-body problem is any problem in classical mechanics or quantum mechanics that models the motion of three particles. The mathematical statement of the
Three-body_problem
Problem in quantum information science
Hamiltonian simulation (also referred to as quantum simulation) is a problem in quantum information science that attempts to find the computational complexity
Hamiltonian_simulation
Limitative results in mathematical logic
criteria is false. The main problem in fleshing out the proof just described is that it seems at first that to construct a statement p that is equivalent to
Gödel's incompleteness theorems
Gödel's_incompleteness_theorems
Free software project
unit tests to verify that the submitted implementations solve the problem statement A framework for running and timing the implementations A website to
The Computer Language Benchmarks Game
The_Computer_Language_Benchmarks_Game
Problem discovery
used for problem finding in literature including problem discovery, problem formulation, problem identification, problem construction, and problem posing
Problem_finding
Construct all metric spaces where lines resemble those on a sphere
mathematics, Hilbert's fourth problem in the 1900 list of Hilbert's problems is a foundational question in geometry. In one statement derived from the original
Hilbert's_fourth_problem
Computer science problem
The firing squad synchronization problem is a problem in computer science and cellular automata in which the goal is to design a cellular automaton that
Firing squad synchronization problem
Firing_squad_synchronization_problem
Problem asking the probability that the sun will rise tomorrow
be used to evaluate the plausibility of the statement, "The sun will rise tomorrow." The sunrise problem was first introduced publicly in 1763 by Richard
Sunrise_problem
Computer programming textbook by Matthias Felleisen and colleagues
"design recipe", a six-step process for creating programs from a problem statement in a step-by-step fashion. While the book was originally used along
How_to_Design_Programs
Optimization problem in operations research
In operations research, the glove problem (also known as the condom problem) is an optimization problem used as an example that the cheapest capital cost
Glove_problem
UNESCO statements about issues of race
has published several statements about issues of race. The statements include: Statement on race (Paris, July 1950) Statement on the nature of race and
UNESCO_statements_on_race
several years. The difficulties described above translate into the following problem: Find an efficient (high-performance and fault tolerant) method to enforce
Global_serializability
Software concurrency problem
computer science, the sleeping barber problem is a classic inter-process communication and synchronization problem that illustrates the complexities that
Sleeping_barber_problem
Problem caused by profanity filters on the Internet
The Scunthorpe problem is the unintentional blocking of online content by a spam filter, search engine or wordfilter because the text contains a string
Scunthorpe_problem
Minimum-cost tree with exactly k vertices
The k-minimum spanning tree problem, studied in theoretical computer science, asks for a tree of minimum cost that has exactly k vertices and forms a
K-minimum_spanning_tree
Abstract mathematics problem
don't know, as the problem statement says nothing about this. Hence, like the previous solution, this solution states that the problem is underspecified
Ross–Littlewood_paradox
Problem of sorting pairs of numbers by their sum
Unsolved problem in computer science Is there an X + Y {\displaystyle X+Y} sorting algorithm faster than O ( n 2 log n ) {\displaystyle O(n^{2}\log
X_+_Y_sorting
Construction of an angle equal to one third a given angle
a classical problem of straightedge and compass construction of ancient Greek mathematics. In 1837, Pierre Wantzel proved that the problem, as stated,
Angle_trisection
18 mathematical problems stated in 1998
Smale's problems is a list of eighteen unsolved problems in mathematics proposed by Steve Smale in 1998 and republished in 1999. Smale composed this list
Smale's_problems
Differential geometry conjecture
Yamabe problem refers to a conjecture in the mathematical field of differential geometry, which was resolved in the 1980s. It is a statement about the
Yamabe_problem
Educational concept
provide a problem statement followed by a step-by-step demonstration of how to solve it. Worked examples are often contrasted with open-ended problem solving
Expertise_reversal_effect
Any type of calculation
encoded into a Turing machine: ("Paul loves me twice as much as Joe"). Problem statements that appear to be well-defined, but for which it can be proved that
Computation
Annual computer programming event
puzzle. The exception is the final star, which is awarded without any problem statement to those that have collected all other stars. As a result, the statistics
Advent_of_Code
The majority problem, or density classification task, is the problem of finding one-dimensional cellular automaton rules that accurately perform majority
Majority_problem
NP-complete graph problem
NP-complete decision problem that involves finding a given graph as an induced subgraph of a larger graph. Formally, the problem takes as input two graphs
Induced subgraph isomorphism problem
Induced_subgraph_isomorphism_problem
Open problem on 3x+1 and x/2 functions
Unsolved problem in mathematics For even numbers, divide by 2; For odd numbers, multiply by 3 and add 1. With enough repetition, do all positive integers
Collatz_conjecture
Philosophical question
logical problem and the evidential problem. One of the earliest statements of the problem is found in early Buddhist texts. In the Majjhima Nikāya, the
Problem_of_evil
Political document written by the Students for a Democratic Society
was written to reflect their view that all problems in every area were linked to each other. The statement expressed SDS's willingness to work with groups
Port_Huron_Statement
23 mathematical problems stated in 1900
closely related unsolved problems exist. Some of Hilbert's statements were not precise enough to specify a particular problem, but were suggestive enough
Hilbert's_problems
Shape containing unit line segments in all directions
a Kakeya needle set. Much of the research in this area has studied the problem of how small such sets can be, first asked by Sōichi Kakeya in 1917. Abram
Kakeya_set
Problem in historical fiction
The Tiffany problem or Tiffany effect refers to the issue where a historical or realistic fact seems anachronistic or unrealistic to modern audiences
Tiffany_problem
Distinction between what is and what ought to be
fundamental epistemological distinction between: Statements of fact (positive or descriptive statements), which are based upon reason and observation, and
Fact–value_distinction
the major problems in philosophy. A counterfactual statement is a conditional statement with a false antecedent. For example, the statement "If Joseph
List of philosophical problems
List_of_philosophical_problems
Multithreading computing anomaly
assume no one has changed the stack. // (That statement is not always true because of the ABA problem) // Atomically replace top with next. if (top_ptr
ABA_problem
Problem in probability theory
In probability theory, the coupon collector's problem refers to mathematical analysis of "collect all coupons and win" contests. It asks the following
Coupon_collector's_problem
Assertion about the feelings, beliefs, values etc. of the person speaking
the statement on the defensive. In a dispute, use of a phrase that begins with "I want" may encourage the parties to engage in positional problem solving
I-message
Unique extension of pure states in Hilbert spaces
extension is unique. That is, the Kadison–Singer problem consisted in proving or disproving the following statement: to every pure state φ {\displaystyle \varphi
Kadison–Singer_problem
IETF working group
recovery and with smaller changes in RFC 8025 and RFC 8066). The problem statement document is RFC 4919. IPv6 over Bluetooth Low Energy using 6LoWPAN
6LoWPAN
Data abstraction problem in programming languages
and while retaining static type safety (e.g., no casts). The statement of the problem exposes deficiencies in programming paradigms and programming languages
Expression_problem
Probability of shared birthdays
In probability theory, the birthday problem asks for the probability that, in a set of n randomly chosen people, at least two will share the same birthday
Birthday_problem
Computer software bug occurring in 2038
The year 2038 problem (also known as Y2038, Y2K38, Y2K38 superbug, or the Epochalypse) is a time computing problem that leaves some computer systems unable
Year_2038_problem
founded on problems that are believed to be intractable. The higher residuosity problem (also called the nth-residuosity problem) is one such problem. This
Higher_residuosity_problem
Equality of areas of a sliced disk
Scientist. Upton, L. J. (1967), "Problem 660", Mathematics Magazine, 40 (3): 163, JSTOR 2688484. Problem statement{{citation}}: CS1 maint: postscript
Pizza_theorem
Unsolved problem in computer science
grids. In this case the problem is in P, as the answer can be found by table lookup.) The precise statement of the P versus NP problem was introduced in 1971
P_versus_NP_problem
Group brainstorming technique
the supervisor. Once the topic of the session is narrowed down to a problem statement, this is announced and written on top of the Idea Form. This is a
6-3-5_Brainwriting
Dublin Statement on Water and Sustainable Development, also known as the Dublin Principles, was a meeting of experts on water related problems that took
Dublin_Statement
PROBLEM STATEMENT
PROBLEM STATEMENT
PROBLEM STATEMENT
PROBLEM STATEMENT
PROBLEM STATEMENT
PROBLEM STATEMENT
PROBLEM STATEMENT
PROBLEM STATEMENT
PROBLEM STATEMENT