|
|
|
|
| LEADER |
05424nam a22006015i 4500 |
| 001 |
978-3-540-74240-1 |
| 003 |
DE-He213 |
| 005 |
20210624143902.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2007 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540742401
|9 978-3-540-74240-1
|
| 024 |
7 |
|
|a 10.1007/978-3-540-74240-1
|2 doi
|
| 050 |
|
4 |
|a QA75.5-76.95
|
| 050 |
|
4 |
|a QA76.63
|
| 072 |
|
7 |
|a UY
|2 bicssc
|
| 072 |
|
7 |
|a COM014000
|2 bisacsh
|
| 072 |
|
7 |
|a UY
|2 thema
|
| 072 |
|
7 |
|a UYA
|2 thema
|
| 082 |
0 |
4 |
|a 004.0151
|2 23
|
| 245 |
1 |
0 |
|a Fundamentals of Computation Theory
|h [electronic resource] :
|b 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings /
|c edited by Erzsébet Csuhaj-Varjú, Zoltán Ésik.
|
| 250 |
|
|
|a 1st ed. 2007.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2007.
|
| 300 |
|
|
|a XIV, 510 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Theoretical Computer Science and General Issues ;
|v 4639
|
| 505 |
0 |
|
|a Invited Lectures -- Rewriting Systems with Data -- Spiking Neural P Systems: Some Characterizations -- Approximating Graphs by Graphs and Functions (Abstract) -- Traces, Feedback, and the Geometry of Computation (Abstract) -- Contributions -- A Largest Common d-Dimensional Subsequence of Two d-Dimensional Strings -- Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs -- A Novel Information Transmission Problem and Its Optimal Solution -- Local Testing of Message Sequence Charts Is Difficult -- On Notions of Regularity for Data Languages -- FJMIP: A Calculus for a Modular Object Initialization -- Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems -- The Complexity of Membership Problems for Circuits over Sets of Positive Numbers -- Pattern Matching in Protein-Protein Interaction Graphs -- From Micro to Macro: How the Overlap Graph Determines the Reduction Graph in Ciliates -- A String-Based Model for Simple Gene Assembly -- On the Computational Power of Genetic Gates with Interleaving Semantics: The Power of Inhibition and Degradation -- On Block-Wise Symmetric Signatures for Matchgates -- Path Algorithms on Regular Graphs -- Factorization of Fuzzy Automata -- Factorisation Forests for Infinite Words -- Marked Systems and Circular Splicing -- The Quantum Query Complexity of Algebraic Properties -- On the Topological Complexity of Weakly Recognizable Tree Languages -- Productivity of Stream Definitions -- Multi-dimensional Packing with Conflicts -- On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time -- Efficient Parameterized Preprocessing for Cluster Editing -- Representing the Boolean OR Function by Quadratic Polynomials Modulo 6 -- On the Complexity of Kings -- Notions of Hyperbolicity in Monoids -- P Systems with Adjoining Controlled Communication Rules -- The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable -- Real-Time Reversible Iterative Arrays -- The Computational Complexity of Monotonicity in Probabilistic Networks -- Impossibility Results on Weakly Black-Box Hardness Amplification -- Maximal and Minimal Scattered Context Rewriting -- Strictly Deterministic CD-Systems of Restarting Automata -- Product Rules in Semidefinite Programming -- Expressive Power of LL(k) Boolean Grammars -- Complexity of Pebble Tree-Walking Automata -- Some Complexity Results for Prefix Gröbner Bases in Free Monoid Rings -- Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs -- An O(1.787 n )-Time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes.
|
| 650 |
|
0 |
|a Computers.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
|
0 |
|a Computer graphics.
|
| 650 |
|
0 |
|a Computer science—Mathematics.
|
| 650 |
1 |
4 |
|a Theory of Computation.
|0 https://scigraph.springernature.com/ontologies/product-market-codes/I16005
|
| 650 |
2 |
4 |
|a Computation by Abstract Devices.
|0 https://scigraph.springernature.com/ontologies/product-market-codes/I16013
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|0 https://scigraph.springernature.com/ontologies/product-market-codes/I16021
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|0 https://scigraph.springernature.com/ontologies/product-market-codes/I16048
|
| 650 |
2 |
4 |
|a Computer Graphics.
|0 https://scigraph.springernature.com/ontologies/product-market-codes/I22013
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|0 https://scigraph.springernature.com/ontologies/product-market-codes/I17028
|
| 700 |
1 |
|
|a Csuhaj-Varjú, Erzsébet.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Ésik, Zoltán.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540842286
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540742395
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues ;
|v 4639
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-540-74240-1
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
