Lower bounds for choiceless polynomial time via symmetric XOR-circuits
From MaRDI portal
Publication:6647709
DOI10.4230/LIPICS.MFCS.2023.73MaRDI QIDQ6647709
Publication date: 3 December 2024
finite model theorygraph isomorphismlogic in computer sciencedescriptive complexitysymmetric computationsymmetric circuits
Related Items (1)
This page was built for publication: Lower bounds for choiceless polynomial time via symmetric XOR-circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6647709)
