A la recherche de la definition de la complexite d'espace pour le calcul des polynomes a la maniere de Valiant

DOI10.2178/jsl/1230396913zbMath1160.03020OpenAlexW2118951952MaRDI QIDQ5502811

Bruno Poizat

Publication date: 9 January 2009

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1230396913

zbMATH Keywords

circuit complexityclasses of functionsValiant circuits

Mathematics Subject Classification ID

Related Items (4)

Une dualité entre fonctions booléennes ⋮ Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity Classes ⋮ Malod and the Pascaline ⋮ Interactive proofs and a Shamir-like result for real number computations

Cites Work

• Unnamed Item
• VPSPACE and a transfer theorem over the reals
• Arithmetization: A new method in structural complexity theory
• Completeness and reduction in algebraic complexity theory
• Fast Parallel Computation of Polynomials Using Few Processors
• Restructuring of Arithmetic Expressions For Parallel Evaluation

This page was built for publication: A la recherche de la definition de la complexite d'espace pour le calcul des polynomes a la maniere de Valiant