Automata, Languages and Programming

DOI10.1007/11523468zbMath1084.11509OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716806

Neeraj Kayal

Publication date: 10 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11523468

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16)

Related Items (3)

An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function ⋮ Matrix Rigidity from the Viewpoint of Parameterized Complexity ⋮ Moment subset sums over finite fields

This page was built for publication: Automata, Languages and Programming