Talk 11 November (today)

6 views

Skip to first unread message

Daniil Musatov

unread,

Nov 10, 2025, 2:13:16 AMNov 10

to Kolmogorov seminar on complexity

Dear participants,

Today on the seminar there will be a continuation of the talk by Fyodor Kuselyov about classes of total search problems and (ir)reducibilities among them. The last time we talked about interrelations between white-box and black-box models. This time we will focus at the black-box model, and the talk will be almost independent of the first one. The plan of the talk is the following:

• Examples of reductions in black-box TFNP

• Definition and motivation of partial assignments

• Irreducibility of PPP to PLS

• Randomized reductions

• Presentation of a new result

Best regards,

Daniil Musatov

unread,

Nov 10, 2025, 4:30:07 AMNov 10

to Kolmogorov seminar on complexity

The time of the seminar is as usual: 18:30 MSK and 16:30 CET.

The link is: https://u-bordeaux-fr.zoom.us/j/88402787361?pwd=WktCdEhBT3pXN0pLUGg4Z3RuMlpsQT09

Daniil Musatov

пн, 10 нояб. 2025 г., 10:13 Daniil Musatov <musa...@gmail.com>:

Reply all

Reply to author

Forward

0 new messages