scientific article; zbMATH DE number 1421070

MaRDI QIDQ4946095zbMATH OpenFDO

Authors Douglas Cenzer, Jeffrey Remmel

Publication date 14 November 2000

zbMATH Keywords

computable Boolean algebracomputable isomorphismpolynomial-time Boolean algebra

Mathematics Subject Classification ID

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

Recommendations

• Computable Boolean algebras
• scientific article; zbMATH DE number 2203952
• Atomless Boolean algebras computable in polynomial time
• Computational bound on complexity of polynomial representations of Boolean functions
• Complexity-theoretic algebra. II: Boolean algebras
• Polynomial-time algorithms for checking some properties of Boolean functions given by polynomials
• Boolean complexity classes vs. their arithmetic analogs
• scientific article; zbMATH DE number 1534579
• Publication:3487327
• scientific article; zbMATH DE number 2193711

Cited in

(15)

• The algebraic structure of the isomorphic types of tally, polynomial time computable sets
• Categoricity for primitive recursive and polynomial Boolean algebras
• Eliminating unbounded search in computable algebra
• Punctual dimension of algebraic structures in certain classes
• Punctual copies of algebraic structures
• Graphs are not universal for online computability
• The back-and-forth method and computability without delay
• Atomless Boolean algebras computable in polynomial time
• Is there a logic for polynomial time?
• P ≠ NP for all infinite Boolean algebras
• Boolean complexity classes vs. their arithmetic analogs
• A structure of punctual dimension two
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
• Algebraic structures computable without delay
• Computable isomorphisms of Boolean algebras with operators

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4946095)