Polynomial-time Abelian groups
From MaRDI portal
Publication:1192353
DOI10.1016/0168-0072(92)90076-CzbMath0764.03015MaRDI QIDQ1192353
Douglas Cenzer, Jeffery B. Remmel
Publication date: 27 September 1992
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Related Items
Definable Subsets of Polynomial-Time Algebraic Structures, Existence and uniqueness of structures computable in polynomial time, Structures computable in polynomial time. I, On the lattices of NP-subspaces of a polynomial time vector space over a finite field, Complexity and categoricity, Punctual copies of algebraic structures, Graphs are not universal for online computability, Primitive recursive reverse mathematics, Punctual 1-linear orders, Feasibly categorical models, Punctually presented structures I: Closure theorems, A structure of punctual dimension two, The complexity of inversion in groups, Categoricity for primitive recursive and polynomial Boolean algebras, Recursively presented games and strategies, 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, Punctual categoricity relative to a computable oracle, AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES, Non-density in punctual computability, Space complexity of abelian groups, FOUNDATIONS OF ONLINE STRUCTURE THEORY, Complexity, decidability and completeness, Feasible graphs with standard universe, Unnamed Item, Quotient structures and groups computable in polynomial time, PUNCTUAL CATEGORICITY AND UNIVERSALITY, Computable embeddability for algebraic structures
Cites Work
