咨询与建议

限定检索结果

文献类型

  • 836 篇 期刊文献
  • 438 篇 会议
  • 86 册 图书
  • 1 篇 学位论文

馆藏范围

  • 1,351 篇 电子文献
  • 10 种 纸本馆藏

日期分布

学科分类号

  • 780 篇 理学
    • 693 篇 数学
    • 57 篇 物理学
    • 43 篇 统计学(可授理学、...
    • 20 篇 系统科学
    • 14 篇 科学技术史(分学科...
    • 13 篇 生物学
    • 11 篇 化学
  • 667 篇 工学
    • 536 篇 计算机科学与技术...
    • 252 篇 软件工程
    • 65 篇 电气工程
    • 53 篇 控制科学与工程
    • 22 篇 电子科学与技术(可...
    • 22 篇 信息与通信工程
    • 12 篇 力学(可授工学、理...
    • 10 篇 机械工程
    • 9 篇 化学工程与技术
    • 8 篇 动力工程及工程热...
    • 6 篇 材料科学与工程(可...
    • 6 篇 建筑学
  • 77 篇 管理学
    • 47 篇 管理科学与工程(可...
    • 24 篇 图书情报与档案管...
    • 6 篇 工商管理
    • 6 篇 公共管理
  • 29 篇 经济学
    • 18 篇 理论经济学
    • 14 篇 应用经济学
  • 24 篇 哲学
    • 20 篇 哲学
  • 12 篇 医学
    • 6 篇 基础医学(可授医学...
    • 6 篇 临床医学
  • 11 篇 法学
    • 11 篇 社会学
  • 8 篇 教育学
    • 5 篇 心理学(可授教育学...
  • 8 篇 农学
  • 6 篇 文学
  • 4 篇 艺术学
  • 1 篇 历史学

主题

  • 1,361 篇 recursive functi...
  • 187 篇 mathematical the...
  • 119 篇 logical theorems
  • 92 篇 recursion
  • 80 篇 algorithms
  • 75 篇 integers
  • 62 篇 recursively enum...
  • 60 篇 natural numbers
  • 57 篇 nasa technical r...
  • 57 篇 (ntrs)
  • 51 篇 degree of unsolv...
  • 46 篇 arithmetic
  • 42 篇 mathematical ind...
  • 34 篇 polynomials
  • 31 篇 recursion theory
  • 31 篇 approximation
  • 31 篇 algebra
  • 27 篇 induction assump...
  • 26 篇 equivalence rela...
  • 23 篇 oracles

机构

  • 7 篇 natl univ singap...
  • 6 篇 univ maryland de...
  • 5 篇 inria
  • 5 篇 univ wisconsin d...
  • 5 篇 univ munster ins...
  • 4 篇 univ kaiserslaut...
  • 4 篇 school of comput...
  • 4 篇 univ calif san d...
  • 4 篇 massachusetts in...
  • 4 篇 rutgers state un...
  • 4 篇 università degli...
  • 3 篇 university of ca...
  • 3 篇 ohio state univ ...
  • 3 篇 mit cambridge ma...
  • 3 篇 institute of mat...
  • 3 篇 univ edinburgh e...
  • 3 篇 univ chicago il ...
  • 3 篇 department of co...
  • 3 篇 univ calif berke...
  • 3 篇 natl univ singap...

作者

  • 11 篇 remmel jb
  • 9 篇 stephan frank
  • 8 篇 jain s
  • 7 篇 jockusch cg
  • 6 篇 zeugmann thomas
  • 6 篇 roversi luca
  • 6 篇 dipaola ra
  • 6 篇 dekker jce
  • 6 篇 jain sanjay
  • 6 篇 wiehagen r
  • 6 篇 kummer m
  • 6 篇 stephan f
  • 5 篇 slaman ta
  • 5 篇 kutrib martin
  • 5 篇 nipkow tobias
  • 5 篇 herrmann e
  • 5 篇 hu zhenjiang
  • 5 篇 downey rg
  • 5 篇 owings jc
  • 5 篇 byerly re

语言

  • 1,303 篇 英文
  • 43 篇 其他
  • 8 篇 法文
  • 3 篇 中文
  • 2 篇 俄文
  • 1 篇 德文
  • 1 篇 日文
检索条件"主题词=Recursive functions"
1361 条 记 录,以下是1-10 订阅
排序:
T-Rex: Termination of recursive functions Using Lexicographic Linear Combinations  51
T-Rex: Termination of Recursive Functions Using Lexicographi...
收藏 引用
51st International Colloquium on Automata, Languages, and Programming, ICALP 2024
作者: Giles, Raphael Douglas Jackson, Vincent Rizkallah, Christine The University of Melbourne Australia
We introduce a powerful termination algorithm for structurally recursive functions that improves on the core ideas behind lexicographic termination algorithms for functional programs. The algorithm generates linear-le... 详细信息
来源: 评论
Approximate Degree Composition for recursive functions  27
Approximate Degree Composition for Recursive Functions
收藏 引用
27th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2024 and the 28th International Conference on Randomization and Computation, RANDOM 2024
作者: Chakraborty, Sourav Kayal, Chandrima Mittal, Rajat Paraashar, Manaswi Saurabh, Nitin Indian Statistical Institute Kolkata India Indian Institute of Technology Kanpur India University of Copenhagen Denmark Indian Institute of Technology Hyderabad India
Determining the approximate degree composition for Boolean functions remains a significant unsolved problem in Boolean function complexity. In recent decades, researchers have concentrated on proving that approximate ... 详细信息
来源: 评论
Path Complexity of recursive functions  23
Path Complexity of Recursive Functions
收藏 引用
45th IEEE/ACM International Conference on Software Engineering (ICSE)
作者: Pregerson, Eli Harvey Mudd Coll Claremont CA 91711 USA
Path coverage is of critical importance in software testing and verification, and further, path explosion is a well-known challenge for automatic software analysis techniques like symbolic execution [7]. Asymptotic Pa... 详细信息
来源: 评论
Solving Constrained Horn Clauses Modulo Algebraic Data Types and recursive functions
收藏 引用
PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL 2022年 第POPL期6卷 1–29页
作者: Govind, Hari V. K. Shoham, Sharon Gurfinkel, Arie Univ Waterloo Dept Elect & Comp Engn Waterloo ON Canada Tel Aviv Univ Tel Aviv Israel
This work addresses the problem of verifying imperative programs that manipulate data structures, e.g., Rust programs. Data structures are usually modeled by Algebraic Data Types (ADTs) in verification conditions. Ind... 详细信息
来源: 评论
Formal definitions and proofs for partial (co)recursive functions
收藏 引用
JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING 2024年 141卷
作者: Cheval, Horatiu Nowak, David Rusu, Vlad Univ Bucharest Fac Math & Comp Sci Dept Comp Sci Res Ctr Logic Optimizat & Secur LOS Bucharest Romania Univ Lille CNRS Cent Lille UMR CRIStAL 9189 F-59000 Lille France Univ Lille Inria CNRS Cent LilleUMR CRIStAL 9189 F-59000 Lille France
Partial functions are a key concept in programming. Without partiality a programming language has limited expressiveness - it is not Turing- complete, hence, it excludes some constructs such as while-loops. In functio... 详细信息
来源: 评论
Intrinsic Complexity of recursive functions on Natural Numbers with Standard Order  39
Intrinsic Complexity of Recursive Functions on Natural Numbe...
收藏 引用
39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022
作者: Bazhenov, Nikolay Kalociński, Dariusz Wroclawski, Michal Sobolev Institute of Mathematics Novosibirsk Russia Institute of Computer Science Polish Academy of Sciences Warsaw Poland Faculty of Philosophy University of Warsaw Poland
The intrinsic complexity of a relation on a given computable structure is captured by the notion of its degree spectrum – the set of Turing degrees of images of the relation in all computable isomorphic copies of tha... 详细信息
来源: 评论
On the Existence Problem of Finite Bases of Identities in the Algebras of recursive functions
收藏 引用
AUTOMATIC CONTROL AND COMPUTER SCIENCES 2021年 第7期55卷 702-711页
作者: Sokolov, V. A. Demidov Yaroslavl State Univ 14 Sovetskaya Yaroslavl 150003 Russia
Raphael Robinson showed that all primitive recursive functions, depending on one argument, and only they could be obtained from two functions s(x) = x + 1 and q(x) = x divided by [root x](2) by using the operations of... 详细信息
来源: 评论
recursive functions on conditional Galton-Watson trees
收藏 引用
RANDOM STRUCTURES & ALGORITHMS 2020年 第2期57卷 304-316页
作者: Broutin, Nicolas Devroye, Luc Fraiman, Nicolas Sorbonne Univ Campus Pierre & Marie CurieCase Courrier 158 4 F-75252 Paris 05 France McGill Univ Sch Comp Sci Montreal PQ Canada Univ N Carolina Dept Stat & Operat Res Chapel Hill NC 27515 USA
A recursive function on a tree is a function in which each leaf has a given value, and each internal node has a value equal to a function of the number of children, the values of the children, and possibly an explicit... 详细信息
来源: 评论
Extensible recursive functions, Algebraically
arXiv
收藏 引用
arXiv 2024年
作者: Hubers, Alex Ingle, Apoorv Marmaduke, Andrew Morris, J. Garrett Department of Computer Science The University of Iowa 14 MacLean Hall Iowa CityIA United States
We explore recursive programming with extensible data types. Row types make the structure of data types first class, and can express a variety of type system features from subtyping to modular combination of case bran... 详细信息
来源: 评论
Approximate Degree Composition for recursive functions
arXiv
收藏 引用
arXiv 2024年
作者: Chakraborty, Sourav Kayal, Chandrima Mittal, Rajat Paraashar, Manaswi Saurabh, Nitin Indian Statistical Institute Kolkata India Indian Institute of Technology Kanpur India University of Copenhagen Denmark Indian Institute of Technology Hyderabad India
Determining the approximate degree composition for Boolean functions remains a significant unsolved problem in Boolean function complexity. In recent decades, researchers have concentrated on proving that approximate ... 详细信息
来源: 评论