咨询与建议

限定检索结果

文献类型

  • 72 篇 期刊文献
  • 17 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 84 篇 工学
    • 80 篇 计算机科学与技术...
    • 17 篇 软件工程
    • 2 篇 电气工程
    • 1 篇 控制科学与工程
  • 49 篇 理学
    • 49 篇 数学
    • 1 篇 统计学(可授理学、...
  • 13 篇 管理学
    • 13 篇 管理科学与工程(可...
  • 1 篇 哲学

主题

  • 89 篇 implicit computa...
  • 23 篇 linear logic
  • 13 篇 lambda calculus
  • 9 篇 type systems
  • 7 篇 theory
  • 7 篇 game semantics
  • 7 篇 polynomial time
  • 6 篇 complexity analy...
  • 6 篇 interactive comp...
  • 6 篇 lambda-calculus
  • 6 篇 polynomial time ...
  • 6 篇 computability lo...
  • 5 篇 polynomial space
  • 5 篇 term rewriting
  • 5 篇 bounded arithmet...
  • 5 篇 type system
  • 5 篇 type assignment
  • 4 篇 languages
  • 4 篇 light linear log...
  • 4 篇 geometry of inte...

机构

  • 5 篇 univ turin dipar...
  • 4 篇 univ bologna dip...
  • 4 篇 univ bologna bol...
  • 4 篇 univ bologna i-4...
  • 3 篇 univ innsbruck i...
  • 3 篇 villanova univ d...
  • 3 篇 villanova univ d...
  • 3 篇 univ bologna dip...
  • 2 篇 syracuse univ de...
  • 2 篇 shandong univ sc...
  • 2 篇 indiana univ blo...
  • 2 篇 univ paris 13 cn...
  • 2 篇 univ lorraine lo...
  • 2 篇 nancy univ ensmn...
  • 2 篇 univ turin dept ...
  • 2 篇 inria sophia ant...
  • 2 篇 univ dundee dund...
  • 2 篇 inria sophia ant...
  • 2 篇 tech univ ilmena...
  • 2 篇 kobe univ grad s...

作者

  • 20 篇 dal lago ugo
  • 11 篇 baillot patrick
  • 11 篇 marion jean-yves
  • 10 篇 gaboardi marco
  • 7 篇 della rocca simo...
  • 7 篇 pechoux romain
  • 6 篇 japaridze giorgi
  • 4 篇 avanzini martin
  • 4 篇 hainry emmanuel
  • 4 篇 eguchi naohi
  • 3 篇 moser georg
  • 3 篇 niggl kh
  • 3 篇 ghyselen alexis
  • 3 篇 kristiansen lars
  • 2 篇 royer james s.
  • 2 篇 mazza damiano
  • 2 篇 danner norman
  • 2 篇 terui kazushige
  • 2 篇 roversi luca
  • 2 篇 kapron bruce m.

语言

  • 84 篇 英文
  • 5 篇 其他
检索条件"主题词=Implicit computational complexity"
89 条 记 录,以下是31-40 订阅
排序:
An arithmetic for non-size-increasing polynomial-time computation
收藏 引用
THEORETICAL COMPUTER SCIENCE 2004年 第1-2期318卷 3-27页
作者: Aehlig, K Berger, U Hoffmann, M Schwichtenberg, H Univ Munich Inst Math D-80333 Munich Germany Univ Coll Swansea Dept Comp Sci Swansea SA2 8PP W Glam Wales Univ Munich Inst Informat D-80538 Munich Germany
An arithmetical system is presented with the property that from every proof a realizing term can be extracted that is definable in a certain affine linear typed variant of Godel's T and therefore defines a non-siz... 详细信息
来源: 评论
Bounded Combinatory Logic and lower complexity
收藏 引用
INFORMATION AND COMPUTATION 2016年 248卷 215-226页
作者: Redmond, Brian F. Grande Prairie Reg Coll Dept Comp Math & Stat Sci 10726-106 Ave Grande Prairie AB T8V 4C4 Canada
We introduce a stratified version of Combinatory Logic(1) in which there are two classes of terms called player and opponent such that the class of player terms is strictly contained in the class of opponent terms. We... 详细信息
来源: 评论
A characterization of alternating log time by ramified recurrence
收藏 引用
THEORETICAL COMPUTER SCIENCE 2000年 第1-2期236卷 193-208页
作者: Leivant, D Marion, JY Indiana Univ Dept Comp Sci Bloomington IN 47405 USA Univ Nancy 2 Loria Projet Calligramme F-54506 Vandoeuvre Nancy France
We give a machine-independent characterization of the class of functions bitwise computable in alternating logarithmic time, with output of polynomial size. Recall that ALogTime is the same, for decision problems, as ... 详细信息
来源: 评论
Certifying polynomial time and linear/polynomial space for imperative programs
收藏 引用
SIAM JOURNAL ON COMPUTING 2006年 第5期35卷 1122-1147页
作者: Niggl, KH Wunderlich, H Tech Univ Ilmenau Inst Theoret Informat D-98684 Ilmenau Germany
In earlier work of Kristiansen and Niggl the polynomial-time computable functions were characterized by stack programs of mu-measure 0, and the linear-space computable functions by loop programs of mu-measure 0. Until... 详细信息
来源: 评论
BUILD YOUR OWN CLARITHMETIC II: SOUNDNESS
收藏 引用
LOGICAL METHODS IN COMPUTER SCIENCE 2016年 第3期12卷
作者: Japaridze, Giorgi Villanova Univ Dept Comp Sci 800 Lancaster Ave Villanova PA 19085 USA
Clarithmetics are number theories based on computability logic. Formulas of these theories represent interactive computational problems, and their "truth" is understood as existence of an algorithmic solutio... 详细信息
来源: 评论
On sharing, memoization, and polynomial time
收藏 引用
INFORMATION AND COMPUTATION 2018年 第Part1期261卷 3-22页
作者: Avanzini, Martin Dal Lago, Ugo Univ Bologna Bologna Italy INRIA Sophia Antipolis France
We study how the adoption of an evaluation mechanism with sharing and memoization impacts the class of functions which can be computed in polynomial time. We first show how a natural cost model in which lookup for an ... 详细信息
来源: 评论
Computation by interaction for space-bounded functional programming
收藏 引用
INFORMATION AND COMPUTATION 2016年 248卷 150-194页
作者: Dal Lago, Ugo Schoepp, Ulrich Univ Bologna I-40126 Bologna Italy INRIA Sophia Antipolis Nice France Univ Munich Marchioninistr 15 D-81377 Munich Germany
When programming with sublinear space constraints one often needs to use special implementation techniques even for simple tasks, such as function composition. In this paper, we study how such implementation technique... 详细信息
来源: 评论
Linear logic by levels and bounded time complexity
收藏 引用
THEORETICAL COMPUTER SCIENCE 2010年 第2期411卷 470-503页
作者: Baillot, Patrick Mazza, Damiano Univ Paris 13 CNRS LIPN UMR 7030 F-93430 Villetaneuse France Univ Lyon ENS Lyon CNRS UMR 5668INRIAUCBLLIP Lyon France
We give a new characterization of elementary and deterministic polynomial time computation in linear logic through the proofs-as-programs correspondence. Girard's seminal results, concerning elementary and light l... 详细信息
来源: 评论
Realizability models and implicit complexity
收藏 引用
THEORETICAL COMPUTER SCIENCE 2011年 第20期412卷 2029-2047页
作者: Dal Lago, Ugo Hofmann, Martin Univ Bologna Dipartimento Sci Informaz I-40126 Bologna Italy Univ Munich Inst Informat D-8000 Munich Germany
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs are obtained by instantiating a semant... 详细信息
来源: 评论
Minimization and NP multifunctions
收藏 引用
THEORETICAL COMPUTER SCIENCE 2004年 第1-2期318卷 105-119页
作者: Danner, N Pollett, C Univ Calif Los Angeles Dept Math Los Angeles CA 90095 USA San Jose State Univ Dept Math & Comp Sci San Jose CA 95192 USA
The implicit characterizations of the polynomial-time computable functions FP given by Bellantoni-Cook and Leivant suggest that this class is the complexity-theoretic analog of the primitive recursive functions. Hence... 详细信息
来源: 评论