Erhard Aichinger

Orcid: 0000-0001-8998-4138

According to our database1, Erhard Aichinger authored at least 13 papers between 2000 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Zero testing and equation solving for sparse polynomials on rectangular domains.
Finite Fields Their Appl., 2024

On NP-Complete Search Problems on Finite Algebras.
Proceedings of the 54th IEEE International Symposium on Multiple-Valued Logic, 2024

2023
The Complexity of Checking Quasi-Identities over Finite Algebras with a Mal'cev Term.
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2022
Finite representation of commutator sequences.
Int. J. Algebra Comput., December, 2022

2020
Congruence preserving expansions of nilpotent algebras.
Int. J. Algebra Comput., 2020

2019
Solving Systems of Equations in Supernilpotent Algebras.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018
Complexity of term representations of finitary functions.
Int. J. Algebra Comput., 2018

2016
Sonata: a GAP tool for nearring computations.
ACM Commun. Comput. Algebra, 2016

2015
Independence of algebras with edge term.
Int. J. Algebra Comput., 2015

2013
Sequences of Commutator Operations.
Order, 2013

2006
Every (k+1)-affine Complete Nilpotent Group of Class K Is Affine Complete.
Int. J. Algebra Comput., 2006

2005
A Bound on The Number of Unary Polynomial Functions and a Decidability Result for Near-Rings.
Int. J. Algebra Comput., 2005

2000
Algorithms for near-rings of non-linear transformations.
Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000


  Loading...