找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: LATIN ‘92; 1st Latin American S Imre Simon Conference proceedings 1992 Springer-Verlag Berlin Heidelberg 1992 Algorithms.Automat.algorithm.

[复制链接]
查看: 30039|回复: 61
发表于 2025-3-21 18:07:57 | 显示全部楼层 |阅读模式
书目名称LATIN ‘92
副标题1st Latin American S
编辑Imre Simon
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: LATIN ‘92; 1st Latin American S Imre Simon Conference proceedings 1992 Springer-Verlag Berlin Heidelberg 1992 Algorithms.Automat.algorithm.
描述This volume contains the proceedings of LATIN ‘92, atheoretical computer science symposium (Latin AmericanTheoretical Informatics) held in S oPaulo, Brazil in April1992. LATIN is intended to be a comprehensivesymposium inthe theory of computing, but for this first meetingthefollowing areas were chosen for preferential coverage:algorithms and data structures, automata and formallanguages, computability and complexity theory,computational geometry, cryptography, parallel anddistributed computation, symbolic and algebraic computation,andcombinatorial and algebraic aspects of computer science.The volume includesfull versions of the invited papers by11 distinguished guest lecturers aswell as 32 contributedpapers selected from 66 submissions from authors withaffiliations in 26 countries.
出版日期Conference proceedings 1992
关键词Algorithms; Automat; algorithm; automata; complexity; complexity theory; computability; computational geome
版次1
doihttps://doi.org/10.1007/BFb0023811
isbn_softcover978-3-540-55284-0
isbn_ebook978-3-540-47012-0Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 1992
The information of publication is updating

书目名称LATIN ‘92影响因子(影响力)




书目名称LATIN ‘92影响因子(影响力)学科排名




书目名称LATIN ‘92网络公开度




书目名称LATIN ‘92网络公开度学科排名




书目名称LATIN ‘92被引频次




书目名称LATIN ‘92被引频次学科排名




书目名称LATIN ‘92年度引用




书目名称LATIN ‘92年度引用学科排名




书目名称LATIN ‘92读者反馈




书目名称LATIN ‘92读者反馈学科排名




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

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:21:59 | 显示全部楼层
发表于 2025-3-22 03:08:28 | 显示全部楼层
发表于 2025-3-22 07:49:24 | 显示全部楼层
https://doi.org/10.1007/BFb0023811Algorithms; Automat; algorithm; automata; complexity; complexity theory; computability; computational geome
发表于 2025-3-22 11:28:04 | 显示全部楼层
发表于 2025-3-22 16:18:04 | 显示全部楼层
A decidability result about convex polyominoes,ight, left, up and down). According to, checking whether a rational language R⊂A. contains a polyomino contour word is undecidable. We restrict the problem to convex polyominoes and we prove that, in this case, the problem turns out to be decidable.
发表于 2025-3-22 17:06:27 | 显示全部楼层
Edge insertion for optimal triangulations,d retriangulating the resulting two polygonal regions. After presenting an abstract view of the paradigm, this paper shows that it can be used to obtain polynomial time algorithms for several types of optimal triangulations.
发表于 2025-3-22 22:21:33 | 显示全部楼层
发表于 2025-3-23 01:45:54 | 显示全部楼层
发表于 2025-3-23 05:48:46 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-25 17:12
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表