Róbert Szelepcsényi

from Wikipedia, the free encyclopedia

Róbert Szelepcsényi (born August 19, 1966 in Žilina ) is a Slovak computer scientist of Hungarian descent.

life and work

Szelepcsenyi, the son of the musician January Szelepcsenyi (* 1937), showed a student at Comenius University in Bratislava in 1987 regardless of Neil Immerman the set of Immerman and Szelepcsényi in complexity theory , for which both the 1995 Gödel Prize received. The theorem says that if a decision problem can be solved by a non-deterministic machine with logarithmically limited storage space, the complementary problem (with interchanged yes / no answers) can also be solved by such a machine. For the temporal complexity the problem is unsolved (2018) and it is generally assumed that such a sentence does not apply in this case.

In 1993 he received a Masters degree from the University of Rochester , was at the University of Chicago and was at the Slovak Academy of Sciences in the late 1990s.

Individual evidence

  1. ↑ birthdates to Milan Strhan, David Daniel (Editor), Slovakia and the Slovaks: A concise encyclopedia , Encyclopedic Institute of the Slovak Academy of Sciences, 1994
  2. ↑ Róbert Szelepcsényi The Method of Forced Enumeration for Nondeterministic Automata , Acta Informatica, Volume 26, 1988, pp. 279-284
  3. ↑ Former Scientist in the Department of Theoretical Computer Science, University of Chicago
  4. ↑ University of Rochester, Department of Computer Science ( Memento of the original from January 4, 2013 in the Internet Archive ) Info: The archive link was inserted automatically and has not yet been checked. Please check the original and archive link according to the instructions and then remove this notice. @1@ 2Template: Webachiv / IABot / www.cs.rochester.edu
personal data
SURNAME Szelepcsényi, Róbert
BRIEF DESCRIPTION Slovak computer scientist
DATE OF BIRTH 19th August 1966
PLACE OF BIRTH Žilina