Fundamentals of computation theory : ; proceedings 14th international symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003
Spremljeno u:
| Autor kompanije: | |
|---|---|
| Daljnji autori: | , |
| Format: | Livre numérique |
| Jezik: | Anglais |
| Izdano: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serija: | Lecture notes in computer science
2751 |
| Teme: | |
| Online pristup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Bilješka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Fundamentals of computation theory, 14th international symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Andrzej Lingas, Bengt J. Nilsson (eds.), Berlin, Springer, 2003, 1 vol. (XII-431 p.), Lecture notes in computer science, 3-540-40543-7 • Fundamentals of Computation Theory, Texte imprimé, 9783662214152 |
| LEADER | 05042nam a22003977a 4500 | ||
|---|---|---|---|
| 001 | 972449 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155224271 | ||
| 020 | |a 9783540450771 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a Symposium on Fundamentals of Computation Theory |n (14 |d :2003 |c :Malmö, SE). | |
| 245 | 1 | 0 | |a Fundamentals of computation theory : ; proceedings |b 14th international symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003 |c [edited by] Andrzej Lingas, Bengt J. Nilsson. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 2751 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Approximability 1 -- Proving Integrality Gaps without Knowing the Linear Program -- An Improved Analysis of Goemans and Williamson s LP-Relaxation for MAX SAT -- Certifying Unsatisfiability of Random 2k-SAT Formulas Using Approximation Techniques -- Approximability 2 -- Inapproximability Results for Bounded Variants of Optimization Problems -- Approximating the Pareto Curve with Local Search for the Bicriteria TSP(1,2) Problem -- Scheduling to Minimize Max Flow Time: Offline and Online Algorithms -- Algorithms 1 -- Linear Time Algorithms for Some NP-Complete Problems on (P 5,Gem)-Free Graphs -- Graph Searching, Elimination Trees, and a Generalization of Bandwidth -- Constructing Sparse t-Spanners with Small Separators -- Composing Equipotent Teams -- Algorithms 2 -- Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers -- An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates -- Periodic Multisorting Comparator Networks -- Fast Periodic Correction Networks -- Networks and Complexity -- Games and Networks -- One-Way Communication Complexity of Symmetric Boolean Functions -- Circuits on Cylinders -- Computational Biology -- Fast Perfect Phylogeny Haplotype Inference -- On Exact and Approximation Algorithms for Distinguishing Substring Selection -- Complexity of Approximating Closest Substring Problems -- Computational Geometry -- On Lawson s Oriented Walk in Random Delaunay Triangulations -- Competitive Exploration of Rectilinear Polygons -- An Improved Approximation Algorithm for Computing Geometric Shortest Paths -- Adaptive and Compact Discretization for Weighted Region Optimal Path Finding -- On Boundaries of Highly Visible Spaces and Applications -- Computational Models and Complexity -- Membrane Computing -- Classical SimulationComplexity of Quantum Machines -- Using Depth to Capture Average-Case Complexity -- Structural Complexity -- Non-uniform Depth of Polynomial Time and Space Simulations -- Dimension- and Time-Hierarchies for Small Time Bounds -- Baire s Categories on Small Complexity Classes -- Formal Languages -- Operations Preserving Recognizable Languages -- Languages Defined by Generalized Equality Sets -- Context-Sensitive Equivalences for Non-interference Based Protocol Analysis -- On the Exponentiation of Languages -- Kleene s Theorem for Weighted Tree-Automata -- Logic -- Weak Cardinality Theorems for First-Order Logic -- Compositionality of Hennessy-Milner Logic through Structural Operational Semantics -- On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 650 | |a Informatique | ||
| 650 | |a Algorithmes | ||
| 650 | |a Complexité de calcul (informatique) | ||
| 650 | |a Logique symbolique et mathématique | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Lingas, Andrzej. |4 pbd | |
| 700 | 1 | |a Nilsson, Bengt J. |4 pbd | |
| 776 | 0 | |0 074202197 |t Fundamentals of computation theory |o 14th international symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003 |f Andrzej Lingas, Bengt J. Nilsson (eds.) |c Berlin |n Springer |d 2003 |p 1 vol. (XII-431 p.) |s Lecture notes in computer science |z 3-540-40543-7 | |
| 776 | 0 | |t Fundamentals of Computation Theory |b Texte imprimé |z 9783662214152 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/b11926 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-MQK01ZKT-S |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750641452 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/b11926 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:753992744 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/b11926 |z Accès INSA CVL | |
| 997 | |0 972449 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||