找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
查看: 30102|回復(fù): 61
樓主
發(fā)表于 2025-3-21 18:07:57 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱LATIN ‘92
副標(biāo)題1st Latin American S
編輯Imre Simon
視頻videohttp://file.papertrans.cn/581/580036/580036.mp4
叢書名稱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
關(guān)鍵詞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影響因子(影響力)學(xué)科排名




書目名稱LATIN ‘92網(wǎng)絡(luò)公開度




書目名稱LATIN ‘92網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱LATIN ‘92被引頻次




書目名稱LATIN ‘92被引頻次學(xué)科排名




書目名稱LATIN ‘92年度引用




書目名稱LATIN ‘92年度引用學(xué)科排名




書目名稱LATIN ‘92讀者反饋




書目名稱LATIN ‘92讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 22:21:59 | 只看該作者
板凳
發(fā)表于 2025-3-22 03:08:28 | 只看該作者
地板
發(fā)表于 2025-3-22 07:49:24 | 只看該作者
https://doi.org/10.1007/BFb0023811Algorithms; Automat; algorithm; automata; complexity; complexity theory; computability; computational geome
5#
發(fā)表于 2025-3-22 11:28:04 | 只看該作者
6#
發(fā)表于 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.
7#
發(fā)表于 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.
8#
發(fā)表于 2025-3-22 22:21:33 | 只看該作者
9#
發(fā)表于 2025-3-23 01:45:54 | 只看該作者
10#
發(fā)表于 2025-3-23 05:48:46 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-12 16:23
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
宁南县| 日土县| 封丘县| 齐齐哈尔市| 鹤岗市| 榆林市| 汉阴县| 新绛县| 奇台县| 宁都县| 江华| 治多县| 溆浦县| 南召县| 锡林郭勒盟| 武城县| 海林市| 金阳县| 韶关市| 昌乐县| 大化| 明光市| 洛南县| 双辽市| 绥江县| 兰溪市| 蒙自县| 军事| 胶州市| 中卫市| 沾化县| 甘谷县| 富阳市| 江安县| 兰坪| 济南市| 商河县| 利川市| 阿图什市| 方山县| 永定县|