A la recherche de la definition de la complexite d'espace pour le calcul des polynomes a la maniere de Valiant (Q5502811): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Completeness and reduction in algebraic complexity theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Arithmetization: A new method in structural complexity theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast Parallel Computation of Polynomials Using Few Processors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Restructuring of Arithmetic Expressions For Parallel Evaluation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: VPSPACE and a transfer theorem over the reals / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4662832 / rank | |||
Normal rank | |||
Revision as of 22:35, 28 June 2024
scientific article; zbMATH DE number 5488475
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A la recherche de la definition de la complexite d'espace pour le calcul des polynomes a la maniere de Valiant |
scientific article; zbMATH DE number 5488475 |
Statements
A la recherche de la definition de la complexite d'espace pour le calcul des polynomes a la maniere de Valiant (English)
0 references
9 January 2009
0 references
circuit complexity
0 references
classes of functions
0 references
Valiant circuits
0 references
