資料來源: Google Book

Mathematical foundations of computer science 2004 :29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004 : proceedings

  • 其他作者: Fiala, Jiří. , Koubek, Václav. , Kratochvíl, Jan. , LINK (Online service)
  • 出版: Berlin : Springer ©2004.
  • 稽核項: 1 online resource (xiv, 902 pages) :illustrations.
  • 叢書名: Lecture notes in computer science ;3153
  • 標題: Informatique , Informatique Mathématiques -- Congrès. , Computer science Mathematics. , HardwareMainframes & Minicomputers. , COMPUTERS , COMPUTERS Hardware -- Mainframes & Minicomputers. , Mathématiques , Mathematics. , Computer science , Computer science Mathematics -- Congresses. , Electronic books. , Mathematics , Mathematical foundations , Conference papers and proceedings.
  • ISBN: 3540286292 , 9783540286295
  • 試查全文@TNUA:
  • 附註: Title from title screen (viewed August 12, 2004). Print version originally published 2004. Includes bibliographical references and index. Invited Lectures -- A Case Study of Genome Evolution: From Continuous to Discrete Time Model -- Multicoloring: Problems and Techniques -- Some Recent Progress in Algorithmic Randomness -- Ubiquitous Parameterization -- Invitation to Fixed-Parameter Algorithms -- PRAM-On-Chip: A Quest for Not-So-Obvious Non-obviousness -- Theory and Applied Computing: Observations and Anecdotes -- Boxed Ambients with Communication Interfaces -- Algebraic Recognizability of Languages -- Geometric Optimization and Unique Sink Orientations of Cubes -- Congestion Games and Coordination Mechanisms -- Graph Algorithms -- Equitable Colorings of Bounded Treewidth Graphs -- The Bidimensional Theory of Bounded-Genus Graphs -- Parallel Knock-Out Schemes in Networks -- Online Algorithms for Disk Graphs -- Approximations -- Protein Folding in the HP Model on Grid Lattices with Diagonals -- Optimization, Games, and Quantified Constraint Satisfaction -- Approximating Boolean Functions by OBDDs -- On Approximation Hardness of the Minimum 2SAT-DELETION Problem -- Graphs and Complexity -- Group Coloring and List Group Coloring Are?2 P -Complete -- Complexity Results in Graph Reconstruction -- Generating Paths and Cuts in Multi-pole (Di)graphs -- Packing Directed Cycles Efficiently -- Circuits -- The Complexity of Membership Problems for Circuits over Sets of Integers -- Some Meet-in-the-Middle Circuit Lower Bounds -- The Enumerability of P Collapses P to NC -- On NC1 Boolean Circuit Composition of Non-interactive Perfect Zero-Knowledge -- General Complexity -- All Superlinear Inverse Schemes Are coNP-Hard -- The Complexity of Equivalence and Isomorphism of Systems of Equations over Finite Groups -- Generation Problems -- One Query Reducibilities Between Partial Information Classes -- Automata -- A New Dimension Sensitive Property for Cellular Automata -- Captive Cellular Automata -- Simulating 3D Cellular Automata with 2D Cellular Automata -- Graph Exploration by a Finite Automaton -- Parametrized
  • 摘要: This book constitutes the refereed proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science, MFCS 2004, held in Prague, Czech Republic in August 2004. The 60 revised full papers presented together with full papers or abstracts of 10 invited talks were carefully reviewed and selected from 167 submissions. The papers are organised in topical sections on graph algorithms, approximation, graphs and complexity, circuits, general complexity, automata, parameterized and kolmogrov complexity, semantics, scheduling, algebraic theory of languages, games, languages, geometry, languages and complexity, quantum computing, and XML.
  • 電子資源: https://dbs.tnua.edu.tw/login?url=https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=136779
  • 系統號: 005310490
  • 資料類型: 電子書
  • 讀者標籤: 需登入
  • 引用網址: 複製連結
This volume contains the papers presented at the 29th Symposium on Mat- matical Foundations of Computer Science, MFCS 2004, held in Prague, Czech Republic, August 22–27, 2004. The conference was organized by the Institute for Theoretical Computer Science (ITI) and the Department of Theoretical Com- terScienceandMathematicalLogic(KTIML)oftheFacultyofMathematicsand Physics of Charles University in Prague. It was supported in part by the Eu- pean Association for Theoretical Computer Science (EATCS) and the European Research Consortium for Informatics and Mathematics (ERCIM). Traditionally, the MFCS symposia encourage high-quality research in all branches of theoretical computer science. Ranging in scope from automata, f- mal languages, data structures, algorithms and computational geometry to c- plexitytheory,modelsofcomputation,andapplicationsincludingcomputational biology, cryptography, security and arti?cial intelligence, the conference o?ers a unique opportunity to researchers from diverse areas to meet and present their results to a general audience. The scienti?c program of this year’s MFCS took place in the lecture halls of the recently reconstructed building of the Faculty of Mathematics and P- sics in the historical center of Prague, with the famous Prague Castle and other celebratedhistoricalmonumentsinsight.Theviewfromthewindowswasach- lengingcompetitionforthespeakersinthe?ghtfortheattentionoftheaudience. But we did not fear the result: Due to the unusually tough competition for this year’s MFCS, the admitted presentations certainly attracted considerable in- rest. The conference program (and the proceedings) consisted of 60 contributed papers selected by the Program Committee from a total of 167 submissions.
來源: Google Book
評分