国家科技图书文献中心 石家庄服务站
首页
资源导航
特色服务
知识发现
关于我们
检索
代查代借

检索历史
浏览历史

订阅
收藏
0 申请单

个人中心
账号设置
充值
全部 |
  • 全部
  • 题名
  • 作者
  • 机构
  • 关键词
  • NSTL主题词
  • 摘要
检索 二次检索 AI检索
高级检索
外文文献 中文文献
筛选条件：

共搜索到1764条信息
?

1. Beyond the Existential Theory of the Reals NSTL国家科技图书文献中心

Marcus Schaefer |  Daniel ?tefankovi? -  《Theory of computing systems》 - 2024,68(2) - 195～226 - 共32页 - 被引量：1

摘要：Abstract We show that completeness at higher |  levels of the theory of the reals is a robust notion |  (under changing the signature and bounding the domain |  of the quantifiers). This mends recognized gaps in |  the hierarchy, and leads to stronger completeness
关键词： Existential theory of the real numbers |  Theory of the reals |  Real hierarchy |  Computational complexity |  Semialgebraic sets |  Hausdorff distance
文献传递获取全文
文献传递
收藏

2. A Closer Look at the Expressive Power of Logics Based on Word Equations NSTL国家科技图书文献中心

Joel Day |  Vijay Ganesh... -  《Theory of computing systems》 - 2024,68(3) - 322～379 - 共58页

摘要：Abstract Word equations are equations α | ?βdocumentclass[12pt]{minimal} usepackage{amsmath} usepackage | {wasysym} usepackage{amsfonts} usepackage{amssymb | } usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek | } setlength{oddsidemargin}{-69pt} begin{document}$$alpha
关键词： Word equations |  String constraints |  String solving |  Regular languages |  Expressibility
文献传递获取全文
文献传递
收藏

3. Rational Index of Languages Defined by Grammars with Bounded Dimension of Parse Trees NSTL国家科技图书文献中心

Ekaterina Shemetova |  Alexander Okhotin... -  《Theory of computing systems》 - 2024,68(3) - 487～511 - 共25页

摘要：Abstract The rational index ρLdocumentclass | [12pt]{minimal} usepackage{amsmath} usepackage{wasysym | } usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy | } usepackage{mathrsfs} usepackage{upgreek} setlength | {oddsidemargin}{-69pt} begin{document}$$rho _L$$end{document
关键词： Dimension of a parse tree |  Strahler number |  k-caterpillar trees |  Rational index |  Context-free grammars |  Multiple context-free grammars |  Quasi-rational languages
文献传递获取全文
文献传递
收藏

4. Reachability in Two-Parametric Timed Automata with one Parameter is EXPSPACE-Complete NSTL国家科技图书文献中心

Stefan Göller |  Mathieu Hilaire -  《Theory of computing systems》 - 2024,68(4) - 900～985 - 共86页

摘要：Abstract Parametric timed automata (PTA) have |  been introduced by Alur, Henzinger, and Vardi as an |  extension of timed automata in which clocks can be |  compared against parameters. The reachability problem |  asks for the existence of an assignment of the
关键词： Parametric timed automata |  Computational complexity |  Reachability |  EXPSPACE-complete
文献传递获取全文
文献传递
收藏

5. New Results on the Remote Set Problem and Its Applications in Complexity Study NSTL国家科技图书文献中心

Yijie Chen |  Kewei Lv -  《Theory of computing systems》 - 2024,68(2) - 283～298 - 共16页

摘要：Abstract In 2015, Haviv introduced the Remote |  set problem (RSP) and studied the complexity of the |  covering radius problem (CRP), which is a classical |  problem in lattices. The RSP aims to identify a set |  containing a point that is sufficiently distant from a
关键词： Remote set problem |  Covering radius problem |  Complexity classes |  Lattice
文献传递获取全文
文献传递
收藏

6. Minimum Cut in O ( m log 2 n ) Time NSTL国家科技图书文献中心

Gawrychowski, Pawel |  Mozes, Shay... -  《Theory of computing systems》 - 2024,68(4) - 814～834 - 共21页

摘要：We give a randomized algorithm that finds a |  minimum cut in an undirected weighted m-edge n-vertex |  graph G with high probability in O(m log(2) n) time | . This is the first improvement to Karger's celebrated |  O(m log(3) n) time algorithm from 1996. Our main
关键词： Minimum cut |  Minimum 2-respecting cut |  Karger's algorithm
文献传递获取全文
文献传递
收藏

7. Subgroup Membership in GL(2,Z) NSTL国家科技图书文献中心

Markus Lohrey -  《Theory of computing systems》 - 2024,68(4) - 1082～1107 - 共26页

摘要：Abstract It is shown that the subgroup |  membership problem for a virtually free group can be |  decided in polynomial time when all group elements are |  represented by so-called power words, i.e., words of the |  form p1z1p2z2pkzkdocumentclass[12pt]{minimal
关键词： Algorithmic group theory |  Subgroup membership problems |  Algorithms for GL(2 |  Z)
文献传递获取全文
文献传递
收藏

8. Equation Satisfiability in Solvable Groups NSTL国家科技图书文献中心

Paweł Idziak |  Piotr Kawałek... -  《Theory of computing systems》 - 2024,68(4) - 740～757 - 共18页

摘要：Abstract The study of the complexity of the |  equation satisfiability problem in finite groups had been |  initiated by Goldmann and Russell in (Inf. Comput. 178(1 | ), 253262, 2002) where they showed that this problem is in |  P for nilpotent groups while it is NP-complete for
关键词： Equations in groups |  Solvable groups |  Exponential time hypothesis |  Fitting length
文献传递获取全文
文献传递
收藏

9. Quantum Algorithm for Lexicographically Minimal String Rotation NSTL国家科技图书文献中心

Qisheng Wang |  Mingsheng Ying -  《Theory of computing systems》 - 2024,68(1) - 29～74 - 共46页 - 被引量：1

摘要：Abstract Lexicographically minimal string |  rotation (LMSR) is a problem to find the minimal one |  among all rotations of a string in the lexicographical |  order, which is widely used in equality checking of |  graphs, polygons, automata and chemical structures. In
关键词： Quantum computing |  Quantum algorithms |  Quantum query complexity |  String problems |  Lexicographically minimal string rotation
文献传递获取全文
文献传递
收藏

10. On the structure of solution-sets to regular word equations NSTL国家科技图书文献中心

Joel D. Day |  Florin Manea -  《Theory of computing systems》 - 2024,68(4) - 662～739 - 共78页

摘要：Abstract For quadratic word equations, there |  exists an algorithm based on rewriting rules which |  generates a directed graph describing all solutions to the |  equation. For regular word equations those for which |  each variable occurs at most once on each side of the
关键词： Quadratic word equations |  Regular word equations |  String solving |  NP
文献传递获取全文
文献传递
收藏

相关推荐

检索结果集分析
检索结果集分析
结构化综述分析
检索条件出处：Theory of computing systems

  • 检索词扩展

    Theory1 of computing systems

    NSTL主题词

    • NSTL学科导航

    服务站

    成员单位

    友情链接

    NSTL官方微信

    官方微信

    NSTL安卓APP

    安卓APP

    服务热线：

    4008-161-200 800-990-8900

    国家科技图书文献中心

    国家科技图书文献中心

    京ICP备10027328号

    © Copyright(C)2023 NSTL.All Rights Reserved 版权所有

    石家庄服务站

    0311-85813912；0311-85813908service@nstl.gov.cn

    地址：石家庄市青园街233号 河北省科学技术情报研究院

    页面总访问量：7956441