Work

Jump Operators, Interactive Proofs and Proof Complexity Generators

Year: 2024

Type: conference-paper

Source: Annual Symposium on Foundations of Computer Science

DOI: 10.1109/focs61266.2024.00044

Author: Erfan Khaniki

Institution: University of Oxford

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

Funder: Grantová Agentura České Republiky

Award: Efficient approximation algorithms and circuit complexity

OpenAlex ID: W4404849615

FWCI:

Cites: 82

Cited by:

Related to: 10