When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Napkin folding problem - Wikipedia

    en.wikipedia.org/wiki/Napkin_folding_problem

    [6] [9] Both involved sinking flaps and so were not necessarily rigidly foldable. The simplest was based on the origami bird base and gave a solution with a perimeter of about 4.12 compared to the original perimeter of 4. The second solution can be used to make a figure with a perimeter as large as desired.

  3. List of undecidable problems - Wikipedia

    en.wikipedia.org/wiki/List_of_undecidable_problems

    [9] [10] Finding the capacity of an information-stable finite state machine channel. [11] In network coding, determining whether a network is solvable. [12] [13] Determining whether a player has a winning strategy in a game of Magic: The Gathering. [14] Planning in a partially observable Markov decision process.

  4. List of unsolved problems in mathematics - Wikipedia

    en.wikipedia.org/wiki/List_of_unsolved_problems...

    Many mathematical problems have been stated but not yet solved. These problems come from many areas of mathematics, such as theoretical physics, computer science, algebra, analysis, combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory, dynamical systems, and partial differential equations.

  5. List of NP-complete problems - Wikipedia

    en.wikipedia.org/wiki/List_of_NP-complete_problems

    The variant where variables are required to be 0 or 1, called zero-one linear programming, and several other variants are also NP-complete [2] [3]: MP1 Some problems related to Job-shop scheduling Knapsack problem , quadratic knapsack problem , and several variants [ 2 ] [ 3 ] : MP9

  6. Collatz conjecture - Wikipedia

    en.wikipedia.org/wiki/Collatz_conjecture

    As an illustration of this, the parity cycle (1 1 0 0 1 1 0 0) and its sub-cycle (1 1 0 0) are associated to the same fraction ⁠ 5 / 7 ⁠ when reduced to lowest terms. In this context, assuming the validity of the Collatz conjecture implies that (1 0) and (0 1) are the only parity cycles generated by positive whole numbers (1 and 2 ...

  7. Hamiltonian path problem - Wikipedia

    en.wikipedia.org/wiki/Hamiltonian_path_problem

    Rendering engines are a form of software used in computer graphics to generate images or models from input data. [27] In three dimensional graphics rendering, a common input to the engine is a polygon mesh. The time it takes to render the object is dependent on the rate at which the input is received, meaning the larger the input the longer the ...

  8. Einstein problem - Wikipedia

    en.wikipedia.org/wiki/Einstein_problem

    Tile(1,1) from Smith, Myers, Kaplan & Goodmann-Strauss on the left. A spectre is obtained by modifying the edges of this polygon as in the middle and right example. In May 2023 the same team (Smith, Myers, Kaplan, and Goodman-Strauss) posted a new preprint about a family of shapes, called "spectres" and related to the "hat", each of which can ...

  9. Tarski's high school algebra problem - Wikipedia

    en.wikipedia.org/wiki/Tarski's_high_school...

    In mathematical logic, Tarski's high school algebra problem was a question posed by Alfred Tarski.It asks whether there are identities involving addition, multiplication, and exponentiation over the positive integers that cannot be proved using eleven axioms about these operations that are taught in high-school-level mathematics.

  1. Related searches uvodnik matematike probleme 4 10 11 graphics 1 49 9

    uvodnik matematike probleme 4 10 11 graphics 1 49 9 8april 10 2011