STACS 2005
From MaRDI portal
Publication:5710699
DOI10.1007/b106485zbMath1119.68094OpenAlexW4230940848MaRDI QIDQ5710699
V. Arvind, T. C. Vijayaraghavan
Publication date: 2 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106485
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)
Related Items (2)
The parallel complexity of graph canonization under abelian group action ⋮ The number of steps for construction of a Boolean solution to polynomial congruences and systems of polynomial congruences
This page was built for publication: STACS 2005
