Showing 1 - 5 results of 5 for search 'Göös, M', query time: 0.02s Refine Results
  1. 1
    Lower bounds for unambiguous automata via communication complexity

    Lower bounds for unambiguous automata via communication complexity by Göös, M, Kiefer, S, Yuan, W

    Published 2022
    Conference item
  2. 2
    Separations in proof complexity and TFNP

    Separations in proof complexity and TFNP by Göös, M, Hollender, A, Jain, S, Maystre, G, Pires, W, Robere, R, Tao, R

    Published 2024
    Journal article
  3. 3
    Separations in proof complexity and TFNP

    Separations in proof complexity and TFNP by Göös, M, Hollender, A, Jain, S, Maystre, G, Pires, W, Robere, R, Tao, R

    Published 2022
    Conference item
  4. 4
    Further collapses in TFNP

    Further collapses in TFNP by Göös, M, Hollender, A, Jain, S, Maystre, G, Pires, W, Robere, R, Tao, R

    Published 2024
    Journal article
  5. 5
    Further collapses in TFNP

    Further collapses in TFNP by Göös, M, Hollender, A, Jain, S, Maystre, G, Pires, W, Robere, R, Tao, R

    Published 2022
    Conference item

Search Tools: