Lower bounds for choiceless polynomial time via symmetric XOR-circuits (Q6647709)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Lower bounds for choiceless polynomial time via symmetric XOR-circuits |
scientific article; zbMATH DE number 7953322
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds for choiceless polynomial time via symmetric XOR-circuits |
scientific article; zbMATH DE number 7953322 |
Statements
Lower bounds for choiceless polynomial time via symmetric XOR-circuits (English)
0 references
3 December 2024
0 references
logic in computer science
0 references
finite model theory
0 references
descriptive complexity
0 references
symmetric computation
0 references
symmetric circuits
0 references
graph isomorphism
0 references
