Nonconstructive proofs of existence for provably total search problems
232 views · Published 13 April 2016 · 1:22:46 · Indexed 16 November 2026
Channel: ФКН НИУ ВШЭ · 2016 · Education
The class TFNP of total NP search problems consists of multivalued functions (total relations) with polynomial-time recognizable graphs. In the complexity-theoretic setting, the totality (existence) is usually established via a combinatorial principle, but it can also be established in a fragment of bounded arithmetic. This talk will give an introduction to these classes, from both points of view (complexity-theoretic and bounded arithmetic). We will also discuss two recent results about the Tucker problem and about the Frege Proof Consistency search problem. Speaker: Sam Buss, University of California, San Diego. Workshop on Theoretical Computer Science 2016: https://cs.hse.ru/en/big-data/tcs-lab/tcs2016/ Faculty of Computer Science: https://cs.hse.ru/en/ Follow us: https://www.facebook.com/hsefcs, https://twitter.com/CS_HSE
More from this channel
-
1:18:31
[Коллоквиум]: On scale invariance, multifractal formalism, and their applications
-
1:09:43
[Коллоквиум]: Resourse Allocation in the Cloud - Assaf Schuster, Techion
-
1:08:04
[ИТ-лекторий] Занимательная прикладная аналитика в Яндексе
-
1:17:41
[Коллоквиум]: Probabilistic graphical models: Factor graphs and more
-
1:05:46
[Коллоквиум]: Process Mining: Data Science in Action - Wil van der Aalst
-
2:18
[Презентация факультета в ДК ЗИЛ]: Григорий Бакунов, директор по распрост. инф. технологий Яндекс
-
2:55
[Презентация факультета в ДК ЗИЛ]: Григорий Канторович, проректор по работе с абитуриентами ВШЭ
-
11:34
[Презентация факультета в ДК ЗИЛ]: Иван Аржанцев, декан факультета компьютерных наук