AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES (Q5207571): Difference between revisions

← Older edit

@@ Property / DOI @@
-.1017/jsl.2019.26
@@ Property / DOI: 10.1017/jsl.2019.26 / rank @@
-Normal rank
@@ Property / author @@
+Nikolay Bazhenov
@@ Property / author: Nikolay Bazhenov / rank @@
+Normal rank
@@ Property / author @@
+Iskander Sh. Kalimullin
@@ Property / author: Iskander Sh. Kalimullin / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2943660833
@@ Property / OpenAlex ID: W2943660833 / rank @@
+Normal rank
@@ Property / cites work @@
+Advice Automatic Structures and Uniformly Automatic Classes
+Normal rank
@@ Property / cites work @@
+Existence and uniqueness of structures computable in polynomial time
+Normal rank
@@ Property / cites work @@
+Computable structures and the hyperarithmetical hierarchy
+Normal rank
@@ Property / cites work @@
+Logical Reversibility of Computation
@@ Property / cites work: Logical Reversibility of Computation / rank @@
+Normal rank
@@ Property / cites work @@
+BREAKING UP FINITE AUTOMATA PRESENTABLE TORSION-FREE ABELIAN GROUPS
+Normal rank
@@ Property / cites work @@
+The Mate-in-n Problem of Infinite Chess Is Decidable
+Normal rank
@@ Property / cites work @@
+Index sets for classes of high rank structures
@@ Property / cites work: Index sets for classes of high rank structures / rank @@
+Normal rank
@@ Property / cites work @@
+Describing free groups
@@ Property / cites work: Describing free groups / rank @@
+Normal rank
@@ Property / cites work @@
+Space complexity of abelian groups
@@ Property / cites work: Space complexity of abelian groups / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-time versus recursive models
@@ Property / cites work: Polynomial-time versus recursive models / rank @@
+Normal rank
@@ Property / cites work @@
+Q4850547
@@ Property / cites work: Q4850547 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4946095
@@ Property / cites work: Q4946095 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-time Abelian groups
@@ Property / cites work: Polynomial-time Abelian groups / rank @@
+Normal rank
@@ Property / cites work @@
+Automaticity of ordinals and of homogeneous graphs
+Normal rank
@@ Property / cites work @@
+Computable completely decomposable groups
@@ Property / cites work: Computable completely decomposable groups / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of computable categoricity
@@ Property / cites work: The complexity of computable categoricity / rank @@
+Normal rank
@@ Property / cites work @@
+The isomorphism problem for torsion-free abelian groups is analytic complete
+Normal rank
@@ Property / cites work @@
+Q4003861
@@ Property / cites work: Q4003861 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4956005
@@ Property / cites work: Q4956005 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3544794
@@ Property / cites work: Q3544794 / rank @@
+Normal rank
@@ Property / cites work @@
+Effective procedures in field theory
@@ Property / cites work: Effective procedures in field theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q5609457
@@ Property / cites work: Q5609457 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5673086
@@ Property / cites work: Q5673086 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4190617
@@ Property / cites work: Q4190617 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5741407
@@ Property / cites work: Q5741407 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4451633
@@ Property / cites work: Q4451633 / rank @@
+Normal rank
@@ Property / cites work @@
+Every recursive linear ordering has a copy in DTIME-SPACE(<i>n</i>,log(<i>n</i>))
+Normal rank
@@ Property / cites work @@
+Recursive Pseudo-Well-Orderings
@@ Property / cites work: Recursive Pseudo-Well-Orderings / rank @@
+Normal rank
@@ Property / cites work @@
+There is no classification of the decidably presentable structures
+Normal rank
@@ Property / cites work @@
+The isomorphism relation on countable torsion free abelian groups
+Normal rank
@@ Property / cites work @@
+On direct products of automaton decidable theories
+Normal rank
@@ Property / cites work @@
+Finitely generated semiautomatic groups
@@ Property / cites work: Finitely generated semiautomatic groups / rank @@
+Normal rank
@@ Property / cites work @@
+Semiautomatic structures
@@ Property / cites work: Semiautomatic structures / rank @@
+Normal rank
@@ Property / cites work @@
+Algebraic structures computable without delay
@@ Property / cites work: Algebraic structures computable without delay / rank @@
+Normal rank
@@ Property / cites work @@
+The diversity of categoricity without delay
@@ Property / cites work: The diversity of categoricity without delay / rank @@
+Normal rank
@@ Property / cites work @@
+From automatic structures to automatic groups.
@@ Property / cites work: From automatic structures to automatic groups. / rank @@
+Normal rank
@@ Property / cites work @@
+Unary automatic graphs: an algorithmic perspective
+Normal rank
@@ Property / cites work @@
+Model-theoretic complexity of automatic structures
+Normal rank
@@ Property / cites work @@
+Three Lectures on Automatic Structures
@@ Property / cites work: Three Lectures on Automatic Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Q3396632
@@ Property / cites work: Q3396632 / rank @@
+Normal rank
@@ Property / cites work @@
+Automatic Structures: Richness and Limitations
@@ Property / cites work: Automatic Structures: Richness and Limitations / rank @@
+Normal rank
@@ Property / cites work @@
+Q4449538
@@ Property / cites work: Q4449538 / rank @@
+Normal rank
@@ Property / cites work @@
+On some games which are relevant to the theory of recursively enumerable sets
+Normal rank
@@ Property / cites work @@
+Q5295696
@@ Property / cites work: Q5295696 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial group theory.
@@ Property / cites work: Combinatorial group theory. / rank @@
+Normal rank
@@ Property / cites work @@
+CONSTRUCTIVE ALGEBRAS I
@@ Property / cites work: CONSTRUCTIVE ALGEBRAS I / rank @@
+Normal rank
@@ Property / cites work @@
+Describing free groups, Part II: Π⁰₄ hardness and no Σ₂⁰ basis
+Normal rank
@@ Property / cites work @@
+Eliminating unbounded search in computable algebra
+Normal rank
@@ Property / cites work @@
+Q3478393
@@ Property / cites work: Q3478393 / rank @@
+Normal rank
@@ Property / cites work @@
+Finite automata presentable Abelian groups
@@ Property / cites work: Finite automata presentable Abelian groups / rank @@
+Normal rank
@@ Property / cites work @@
+Strong and weak constructivization and computable families
+Normal rank
@@ Property / cites work @@
+STACS 2005
@@ Property / cites work: STACS 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Computable Algebra, General Theory and Theory of Computable Fields
+Normal rank
@@ Property / cites work @@
+The decomposability problem for torsion-free abelian groups is analytic-complete
+Normal rank
@@ Property / cites work @@
+Enumerations of families of general recursive functions
+Normal rank
@@ Property / cites work @@
+Q4040892
@@ Property / cites work: Q4040892 / rank @@
+Normal rank
@@ Property / cites work @@
+Recursive well-orderings
@@ Property / cites work: Recursive well-orderings / rank @@
+Normal rank
@@ Property / cites work @@
+The classification problem for torsion-free abelian groups of finite rank
+Normal rank
@@ Property / cites work @@
+The additive group of the rationals does not have an automatic presentation
+Normal rank
@@ Property / Wikidata QID @@
+Q128022821
@@ Property / Wikidata QID: Q128022821 / rank @@
+Normal rank
@@ Property / DOI @@
+.1017/JSL.2019.26
@@ Property / DOI: 10.1017/JSL.2019.26 / rank @@
+Normal rank
@@ Property / Recommended article @@
+There is no classification of the decidably presentable structures
+Normal rank
+Similarity Score: 0.83469534Amount 0.83469534
Unit 1
-Amount
+.83469534
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Automatic Structures: Richness and Limitations
+Normal rank
+Similarity Score: 0.79663914Amount 0.79663914
Unit 1
-Amount
+.79663914
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Searching for applicable versions of computable structures
+Normal rank
+Similarity Score: 0.77599454Amount 0.77599454
Unit 1
-Amount
+.77599454
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Size and Computation of Injective Tree Automatic Presentations
+Normal rank
+Similarity Score: 0.7666384Amount 0.7666384
Unit 1
-Amount
+.7666384
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q2904765
@@ Property / Recommended article: Q2904765 / rank @@
+Normal rank
@@ Property / Recommended article: Q2904765 / qualifier @@
+Similarity Score: 0.7661671Amount 0.7661671
Unit 1
-Amount
+.7661671
 Unit
@@ Property / Recommended article: Q2904765 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Finite presentations of infinite structures: Automata and interpretations
+Normal rank
+Similarity Score: 0.7637905Amount 0.7637905
Unit 1
-Amount
+.7637905
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Finitely generated structures computable in polynomial time
+Normal rank
+Similarity Score: 0.754948Amount 0.754948
Unit 1
-Amount
+.754948
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Automata Presenting Structures: A Survey of the Finite String Case
+Normal rank
+Similarity Score: 0.7486971Amount 0.7486971
Unit 1
-Amount
+.7486971
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Polynomial-time versus recursive models
@@ Property / Recommended article: Polynomial-time versus recursive models / rank @@
+Normal rank
+Similarity Score: 0.74769264Amount 0.74769264
Unit 1
-Amount
+.74769264
 Unit
+Recommender Run: Recommender Run 2