intractability

  • 61NP-equivalent — In computational complexity theory, the complexity class NP equivalent is the set of function problems that are both NP easy and NP hard.[1] NP equivalent is the analogue of NP complete for function problems. For example, the problem FIND SUBSET… …

    Wikipedia

  • 62Post correspondence problem — The Post correspondence problem is an undecidable decision problem that was introduced by Emil Post in 1946.[1] Because it is simpler than the halting problem and the Entscheidungsproblem it is often used in proofs of undecidability. Contents 1… …

    Wikipedia

  • 63Distributive justice — concerns what some consider to be socially just allocation of goods in a society. A society in which incidental inequalities in outcome do not arise would be considered a society guided by the principles of distributive justice[citation needed].… …

    Wikipedia

  • 64Nero Wolfe — This article is about Rex Stout s fictional detective. For other uses, see Nero Wolfe (disambiguation). Bitter End Carl Mueller illustrated Rex Stout s first Nero Wolfe novella for The American Magazine (November 1940) Nero Wolfe is a fictional… …

    Wikipedia

  • 65Sequence alignment — In bioinformatics, a sequence alignment is a way of arranging the sequences of DNA, RNA, or protein to identify regions of similarity that may be a consequence of functional, structural, or evolutionary relationships between the sequences.[1]… …

    Wikipedia

  • 66Hamiltonian path problem — This article is about the specific problem of determining whether a Hamiltonian path or cycle exists in a given graph. For the general graph theory concepts, see Hamiltonian path. In the mathematical field of graph theory the Hamiltonian path… …

    Wikipedia

  • 67Louis le Brocquy — Infobox Artist name = Louis le Brocquy imagesize = 230px caption = Photograph by Perry Ogden, 2000 birthdate = Birth date and age|1916|11|10|df=yes location = Dublin, Ireland deathdate = deathplace = nationality = Irish field = Painting, Drawing …

    Wikipedia

  • 68Quadratic residue — In number theory, an integer q is called a quadratic residue modulo n if it is congruent to a perfect square modulo n; i.e., if there exists an integer x such that: Otherwise, q is called a quadratic nonresidue modulo n. Originally an abstract… …

    Wikipedia

  • 69Ilyushin Il-86 — infobox Aircraft name =Il 86 type =Wide body airliner manufacturer =MAP Factory No 64 and WSK PZL Mielec caption =An Il 86 of Aeroflot first flight =December 22, 1976 introduction =1980 status =Operational produced =1977 1994 primary user = S7… …

    Wikipedia

  • 70Bin packing problem — In computational complexity theory, the bin packing problem is a combinatorial NP hard problem. In it, objects of different volumes must be packed into a finite number of bins of capacity V in a way that minimizes the number of bins used.There… …

    Wikipedia