Computational Complexity of Solving Equation Systems

Abstract

We present conclusions and open problems raising from studying solving equations over unary algebras. We suggest areas that are most promising for expanding our knowledge

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

Introduction.Przemysław Broniek - 1st ed. 2015 - In Computational Complexity of Solving Equation Systems. Springer International Publishing.
On the computational complexity of integral equations.Ker-I. Ko - 1992 - Annals of Pure and Applied Logic 58 (3):201-228.
Free set algebras satisfying systems of equations.G. Aldo Antonelli - 1999 - Journal of Symbolic Logic 64 (4):1656-1674.
Recursive unary algebras and trees.Bakhadyr Khoussainov - 1994 - Annals of Pure and Applied Logic 67 (1-3):213-268.
A Step towards a Complexity Theory for Analog Systems.K. Meer & M. Gori - 2002 - Mathematical Logic Quarterly 48 (S1):45-58.

Analytics

Added to PP
2015-08-16

Downloads
23 (#644,212)

6 months
2 (#1,157,335)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references