咨询与建议

限定检索结果

文献类型

  • 7 篇 期刊文献
  • 1 篇 学位论文
  • 1 篇 会议

馆藏范围

  • 9 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 6 篇 理学
    • 6 篇 数学
  • 3 篇 工学
    • 3 篇 计算机科学与技术...
  • 1 篇 管理学
    • 1 篇 管理科学与工程(可...

主题

  • 9 篇 algorithmic prob...
  • 1 篇 inductive hierar...
  • 1 篇 kolmogorov compl...
  • 1 篇 undecidable prob...
  • 1 篇 root
  • 1 篇 inductive turing...
  • 1 篇 associative alge...
  • 1 篇 free associative...
  • 1 篇 algorithmic oper...
  • 1 篇 affine automaton
  • 1 篇 spectrum
  • 1 篇 algorithmic tech...
  • 1 篇 inductive algori...
  • 1 篇 relative order
  • 1 篇 free group
  • 1 篇 mortality proble...
  • 1 篇 recursive algori...
  • 1 篇 algebraic equiva...
  • 1 篇 stallings au-tom...
  • 1 篇 subgroup

机构

  • 1 篇 univ basque coun...
  • 1 篇 univ politecn ca...
  • 1 篇 uniwersytet wroc...
  • 1 篇 university of ca...
  • 1 篇 univ calif los a...
  • 1 篇 natl tech univ u...
  • 1 篇 univ calif los a...
  • 1 篇 upc barcelonatec...

作者

  • 1 篇 glukhov m.m.
  • 1 篇 yagzhev av
  • 1 篇 zakharov alexand...
  • 1 篇 belegradek ov
  • 1 篇 delgado jordi
  • 1 篇 mohanty sidhanth
  • 1 篇 remeslennikov vn
  • 1 篇 burgin m
  • 1 篇 ventura enric
  • 1 篇 gvaramiya a.a.
  • 1 篇 burgin mark
  • 1 篇 rystsov i. k.

语言

  • 9 篇 英文
检索条件"主题词=algorithmic problem"
9 条 记 录,以下是1-10 订阅
排序:
algorithmic problem OF RECOGNIZING AUTOMORPHISMS AMONG ENDOMORPHISMS OF FREE ASSOCIATIVE ALGEBRAS OF FINITE RANK
收藏 引用
SIBERIAN MATHEMATICAL JOURNAL 1980年 第1期21卷 142-146页
作者: YAGZHEV, AV
来源: 评论
AN algorithmic problem FOR NILPOTENT GROUPS AND RINGS
收藏 引用
SIBERIAN MATHEMATICAL JOURNAL 1979年 第5期20卷 761-764页
作者: REMESLENNIKOV, VN
来源: 评论
ALGEBRAIC EQUIVALENTS OF THE SOLVABILITY OF GROUP-THEORETIC algorithmic problemS
收藏 引用
SIBERIAN MATHEMATICAL JOURNAL 1979年 第5期20卷 673-680页
作者: BELEGRADEK, OV
来源: 评论
Solution of the basic algorithmic problems in some classes of quasigroups with identities
收藏 引用
Siberian Mathematical Journal 1969年 第2期10卷 211-224页
作者: Gvaramiya, A.A. Glukhov, M.M.
来源: 评论
Superrecursive hierarchies of algorithmic problems
Superrecursive hierarchies of algorithmic problems
收藏 引用
International Conference on Foundations of Computer Science (FCS 05)
作者: Burgin, M Univ Calif Los Angeles Dept Comp Sci Los Angeles CA 90095 USA
In this paper, complexity of an algorithmic problem, such as the halting problem for Turing machines, is measured by the classes of automata that are necessary to solve this problem. To classify different problems wit... 详细信息
来源: 评论
MORTALITY problem AND AFFINE AUTOMATA
收藏 引用
CYBERNETICS AND SYSTEMS ANALYSIS 2008年 第2期44卷 170-174页
作者: Rystsov, I. K. Natl Tech Univ Ukraine Kiev Polytech Inst Kiev Ukraine
The mortality problem for 2 Chi 2 matrices is treated from the automata theory viewpoint. This problem is shown to be closely related to the reachability problem for linear and affine automata of low dimensions. The d... 详细信息
来源: 评论
algorithmic complexity as a criterion of unsolvability
收藏 引用
THEORETICAL COMPUTER SCIENCE 2007年 第2-3期383卷 244-259页
作者: Burgin, Mark Univ Calif Los Angeles Dept Math Los Angeles CA 90095 USA
There is a dependency between computability of algorithmic complexity and decidability of different algorithmic problems. It is known that computability of the algorithmic complexity C(x) is equivalent to decidability... 详细信息
来源: 评论
Phase Transitions in Inference
Phase Transitions in Inference
收藏 引用
作者: Mohanty, Sidhanth University of California Berkeley
学位级别:Ph.D., Doctor of Philosophy
What makes an algorithmic problem easy or hard? Many general algorithmic techniques arising from decades of research, along with the theory of NP-completeness based on reductions between hard problems, offers a good a... 详细信息
来源: 评论
Relative order and spectrum in free and related groups
收藏 引用
COMMUNICATIONS IN CONTEMPORARY MATHEMATICS 2024年 第1期26卷 2250066-2250066页
作者: Delgado, Jordi Ventura, Enric Zakharov, Alexander Univ Basque Country EHU Dept Math Bilbao Spain Univ Politecn Cataluna Dept Matemat Catalonia Spain UPC BarcelonaTech Inst Matemat Catalonia Spain Uniwersytet Wroclawski Inst Matemat Pl Grunwaldzki 2-4 PL-50384 Wroclaw Poland
In this paper, we consider a natural generalization of the concept of order of an element in a group: an element g is an element of G is said to have order k in a subgroup H of G (respectively, in a coset Hu) if k is ... 详细信息
来源: 评论