scientific article; zbMATH DE number 1421070

zbMath0948.03039MaRDI QIDQ4946095

Douglas Cenzer, Jeffery B. Remmel

Publication date: 14 November 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computable isomorphismcomputable Boolean algebrapolynomial-time Boolean algebra

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Theory of numerations, effectively presented structures (03D45)

Related Items

Punctual copies of algebraic structures, Graphs are not universal for online computability, A structure of punctual dimension two, Algebraic structures computable without delay, Eliminating unbounded search in computable algebra, The back-and-forth method and computability without delay, Punctual dimension of algebraic structures in certain classes, AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES