Question: Information: - Russia (from the Rus'), also officially known as the Russian Federation, is a country in Eurasia. At , Russia is the largest country in the world by surface area, covering more than one-eighth of the Earth's inhabited land area, and the ninth most populous, with over 140million people at the end of March 2016. The European western part of the country is much more populated and urbanised than the eastern, about 77% of the population live in European Russia. Russia's capital Moscow is one of the largest cities in the world, other major urban centers include Saint Petersburg, Novosibirsk, Yekaterinburg, Nizhny Novgorod and Samara. - Grand Duke Sergei Mikhailovich of Russia (7 October 1869 18 July 1918) was the fifth son and sixth child of Grand Duke Michael Nikolaievich of Russia and a first cousin of Alexander III of Russia. - Varvara Alexeyevna Yakovleva ( Russian : ; died July 18 , 1918 ) , called Nun Barbara , was a Russian Orthodox nun in the convent of Grand Duchess Elizabeth Fyodorovna . She was killed by the Bolsheviks along with the grand duchess and Prince Ioann Konstantinovich of Russia , Prince Konstantin Konstantinovich of Russia , Prince Igor Konstantinovich of Russia , Grand Duke Sergei Mikhailovich of Russia , Fyodor Remez , Grand Duke Sergei 's secretary , and Prince Vladimir Pavlovich Paley at Alapaevsk . She was later canonized as a martyr by both the Russian Orthodox Church Outside Russia and the Russian Orthodox Church within Russia . - Alexander III (1845 1894) was the Emperor of Russia, King of Poland, and Grand Duke of Finland from until his death on . He was highly conservative and reversed some of the liberal reforms of his father, Alexander II. During Alexander's reign Russia fought no major wars, for which he was styled "The Peacemaker". - The Bolsheviks, originally also Bolshevists or Bolsheviki (derived from "bol'shinstvo", "majority", literally meaning "one of the majority") were a faction of the Marxist Russian Social Democratic Labour Party (RSDLP) which split apart from the Menshevik faction at the Second Party Congress in 1903. The RSDLP was a revolutionary socialist political party formed in 1898 in Minsk(Belarus) to unite the various revolutionary organisations of the Russian Empire into one party. Given the paragraphs above, decide what entity has the relation 'date of death' with '18 july 1918'.
Answer: barbara

Question: Information: - In logic, mathematics and computer science, especially metalogic and computability theory, an effective method or effective procedure is a procedure for solving a problem from a specific class. An effective method is sometimes also called mechanical method or procedure. - Complexity describes the behaviour of a system or model whose components interact in multiple ways and follow local rules, meaning there is no reasonable higher instruction to define the various possible interactions. - Computational complexity theory is a branch of the theory of computation in theoretical computer science that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. A computational problem is understood to be a task that is in principle amenable to being solved by a computer, which is equivalent to stating that the problem may be solved by mechanical application of mathematical steps, such as an algorithm. - In complexity theory, a decision problem is P-complete (complete for the complexity class P) if it is in P and every problem in P can be reduced to it by an appropriate reduction. - In computability theory and computational complexity theory, a decision problem is a question in some formal system that can be posed as a yes-no question, dependant on the input values. Decision problems typically appear in mathematical questions of decidability, that is, the question of the existence of an effective method to determine the existence of some object or its membership in a set; some of the most important problems in mathematics are undecidable. - In computational complexity theory , a decision problem is NP - complete when it is both in NP and NP - hard . The set of NP - complete problems is often denoted by NP - C or NPC . The abbreviation NP refers to '' nondeterministic polynomial time '' . Although any given solution to an NP - complete problem can be verified quickly ( in polynomial time ) , there is no known efficient way to locate a solution in the first place ; indeed , the most notable characteristic of NP - complete problems is that no fast solution to them is known . That is , the time required to solve the problem using any currently known algorithm increases very quickly as the size of the problem grows . As a consequence , determining whether or not it is possible to solve these problems quickly , called the P versus NP problem , is one of the principal unsolved problems in computer science today . While a method for computing the solutions to NP - complete problems using a reasonable amount of time remains undiscovered , computer scientists and programmers still frequently encounter NP - complete problems . NP - complete problems are often addressed by using heuristic methods and approximation algorithms . - Theoretical computer science, or TCS, is a division or subset of general computer science and mathematics that focuses on more abstract or mathematical aspects of computing and includes the theory of computation. - Computability theory, also called recursion theory, is a branch of mathematical logic, of computer science, and of the theory of computation that originated in the 1930s with the study of computable functions and Turing degrees. The field has since grown to include the study of generalized computability and definability. In these areas, recursion theory overlaps with proof theory and effective descriptive set theory. - In theoretical computer science and mathematics, the theory of computation is the branch that deals with how efficiently problems can be solved on a model of computation, using an algorithm. The field is divided into three major branches: automata theory and language, computability theory, and computational complexity theory, which are linked by the question: ""What are the fundamental capabilities and limitations of computers?"." - A computer is a device that can be instructed to carry out an arbitrary set of arithmetic or logical operations automatically. The ability of computers to follow a sequence of operations, called a "program", make computers very flexible and useful. Such computers are used as control systems for a very wide variety of industrial and consumer devices. This includes simple special purpose devices like microwave ovens and remote controls, factory devices such as industrial robots and computer assisted design, but also in general purpose devices like personal computers and mobile devices such as smartphones. The Internet is run on computers and it connects millions of other computers. - A formal system or logical calculus is any well-defined system of abstract thought based on the model of mathematics. A formal system need not be mathematical as such; for example, Spinoza's "Ethics" imitates the form of Euclid's "Elements".. Spinoza employed Euclidiean elements such as "axioms" or "primitive truths", rules of inferences etc. so that a calculus can be build using these. For nature of such primitive truths, one can consult Tarski's "Concept of truth for a formalized language". - In mathematics and computer science, an algorithm is a self-contained sequence of actions to be performed. Algorithms perform calculation, data processing, and/or automated reasoning tasks. - In theoretical computer science, a computational problem is a mathematical object representing a collection of questions that computers might be able to solve. For example, the problem of factoring Given the paragraphs above, decide what entity has the relation 'instance of' with 'complexity class'.
Answer:
np-completeness