找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Automata, Languages and Programming; Eighth Colloquium, A Shimon Even,Oded Kariv Conference proceedings 1981 Springer-Verlag Berlin Heidelb

[复制链接]
查看: 9099|回复: 55
发表于 2025-3-21 16:24:01 | 显示全部楼层 |阅读模式
期刊全称Automata, Languages and Programming
期刊简称Eighth Colloquium, A
影响因子2023Shimon Even,Oded Kariv
视频video
学科分类Lecture Notes in Computer Science
图书封面Titlebook: Automata, Languages and Programming; Eighth Colloquium, A Shimon Even,Oded Kariv Conference proceedings 1981 Springer-Verlag Berlin Heidelb
Pindex Conference proceedings 1981
The information of publication is updating

书目名称Automata, Languages and Programming影响因子(影响力)




书目名称Automata, Languages and Programming影响因子(影响力)学科排名




书目名称Automata, Languages and Programming网络公开度




书目名称Automata, Languages and Programming网络公开度学科排名




书目名称Automata, Languages and Programming被引频次




书目名称Automata, Languages and Programming被引频次学科排名




书目名称Automata, Languages and Programming年度引用




书目名称Automata, Languages and Programming年度引用学科排名




书目名称Automata, Languages and Programming读者反馈




书目名称Automata, Languages and Programming读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

1票 100.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:01:11 | 显示全部楼层
Getting Started with Containers in AzureLet F be a n-variate polynomial with deg F = d over an infinite field k.. Absolute primality of F can be decided randomly in time polynomial in n and exponential in d. and determinalistically in time exponential in d. + n. d..
发表于 2025-3-22 03:32:28 | 显示全部楼层
发表于 2025-3-22 05:18:49 | 显示全部楼层
https://doi.org/10.1007/978-1-4842-8045-4We shall briefly survey what the author believes are some of the most fruitful directions in relational database theory. These directions include dependency inferences, support for the universal relation concept, null value semantics, and an exploration of the properties of acyclic database schemes.
发表于 2025-3-22 12:45:41 | 显示全部楼层
发表于 2025-3-22 12:55:55 | 显示全部楼层
Absolute primality of polynomials is decidable in random polynomial time in the number of variablesLet F be a n-variate polynomial with deg F = d over an infinite field k.. Absolute primality of F can be decided randomly in time polynomial in n and exponential in d. and determinalistically in time exponential in d. + n. d..
发表于 2025-3-22 17:29:19 | 显示全部楼层
Algorithmic specifications of abstract data types,A new method for the specification of abstract data types is presented. Being algorithmic it avoids several difficulties of the algebraic specification method.
发表于 2025-3-23 00:14:09 | 显示全部楼层
A view of directions in relational database theory,We shall briefly survey what the author believes are some of the most fruitful directions in relational database theory. These directions include dependency inferences, support for the universal relation concept, null value semantics, and an exploration of the properties of acyclic database schemes.
发表于 2025-3-23 04:43:28 | 显示全部楼层
发表于 2025-3-23 07:22:09 | 显示全部楼层
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/166209.jpg
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-10 08:52
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表