input: Please answer the following: Information: - Antoaneta Stefanova (born 19 April 1979) is a Bulgarian chess grandmaster and a former Women's World Champion. - Chess is a two-player strategy board game played on a chessboard, a checkered gameboard with 64squares arranged in an eight-by-eight grid. Chess is played by millions of people worldwide, both amateurs and professionals. - The Bulgarian Chess Championship is an event inaugurated in 1933 to crown the best chess player in Bulgaria. The championship has been held on a nearly annual basis since, with only a few years missed. In recent years some of the very best Bulgarian players have not participated in the championship, including former World Champions Veselin Topalov and Antoaneta Stefanova. - Romania is a sovereign state located in Southeastern Europe. It borders the Black Sea, Bulgaria, Ukraine, Hungary, Serbia, and Moldova. It has an area of and a temperate-continental climate. With 19.94 million inhabitants, the country is the seventh-most-populous member state of the European Union. The capital and largest city, Bucharest, with its 1,883,425 inhabitants is the sixth-largest city in the EU. - Bulgaria (tr. '), officially the Republic of Bulgaria (tr. '), is a country in southeastern Europe. It is bordered by Romania to the north, Serbia and Macedonia to the west, Greece and Turkey to the south, and the Black Sea to the east. With a territory of , Bulgaria is Europe's 16th-largest country. - Oleg Nikolaev Neikirch ( Neikirh , Nejkirch , Neykirch ) ( Bulgarian : ) ( 8 March 1914 , Tbilisi , Georgia - 26 August 1985 , Bulgaria ) was a Bulgarian chess master . He won seven times Bulgarian Chess Championship ( 1937 , 1938 , 1940 ( jointly ) , 1943 , 1948 ( jointly ) , 1953 ( jointly ) , and 1957 ) . He represented Bulgaria in four Chess Olympiads ( 1939 , 1954 , 1958 , and 1960 ) . In 1939 , at second board in 8th Chess Olympiad in Buenos Aires ( +6 -- 5 = 4 ) ; In 1954 , at second board in 11th Chess Olympiad in Amsterdam ( +1 -- 2 = 4 ) ; In 1958 , at first board in 13th Chess Olympiad in Munich ( +1 -- 6 = 6 ) ; In 1960 , at third board in 14th Chess Olympiad in Leipzig ( +4 -- 4 = 6 ) . He tied for 2nd - 4th at Sofia 1957 ( zonal ; Miroslav Filip won ) , and took 15th at Portoroz 1958 ( Interzonal ; Mikhail Tal won ) . He was awarded the International Master ( IM ) title in 1957 . - Veselin Aleksandrov Topalov (pronounced born 15 March 1975) is a Bulgarian chess grandmaster and former FIDE World Chess Champion. - Serbia, officially the Republic of Serbia, is a sovereign state situated at the crossroads of Central and Southeast Europe, covering the southern part of the Pannonian Plain and the central Balkans. Relative to its small territory, it is a diverse country distinguished by a "transitional" character, situated along cultural, geographic, climatic and other boundaries. Serbia is landlocked and borders Hungary to the north; Romania and Bulgaria to the east; Macedonia to the south; and Croatia, Bosnia-Herzegovina, and Montenegro to the southwest; it also claims a border with Albania through the disputed territory of Kosovo. Serbia numbers around 7 million residents, and its capital, Belgrade, ranks among the largest cities in Southeast Europe. - The Black Sea is a body of water between Eastern Europe and Western Asia, bounded by Bulgaria, Georgia, Romania, Russia, Turkey, and Ukraine. It is supplied by a number of major rivers, such as the Danube, Dnieper, Rioni, Southern Bug, and Dniester. The Black Sea has an area of (not including the Sea of Azov), a maximum depth of , and a volume of . It is constrained by the Pontic Mountains to the south and by the Caucasus Mountains to the east, and features a wide shelf to the northwest. The longest east-west extent is about . Given the information, choose the subject and object entities that have the relation of 'occupation'.
++++++++++
output: oleg neikirch , chess player

input: Please answer the following: Information: - 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 - 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?"." - 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. - 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. - 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. - In computational complexity theory, the complexity class ELEMENTARY of elementary recursive functions is the union of the classes - In computational complexity theory , a nonelementary problem is a problem that is not a member of the class ELEMENTARY . Examples of nonelementary problems that are nevertheless decidable include : the problem of regular expression equivalence with complementation decision problem for monadic second - order logic over trees decision problem for term algebras - 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 computational complexity theory, a complexity class is a set of problems of related resource-based complexity. A typical complexity class has a definition of the form: - 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. Given the information, choose the subject and object entities that have the relation of 'instance of'.
++++++++++
output:
nonelementary problem , complexity class