The complexity of finding supergraphs

DOI10.1007/978-3-031-36978-0_15MaRDI QIDQ6149042

Arno Pauly, Vittorio Cipriani

Publication date: 12 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
• Infinite versions of some problems from finite complexity theory
• Degrees of bi-embeddable categoricity of equivalence structures
• On the algebraic structure of Weihrauch degrees
• Degrees of bi-embeddable categoricity
• Weihrauch Complexity in Computable Analysis
• Reverse mathematics and Weihrauch analysis motivated by finite complexity theory