Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Fundamentals of Computation Theory [[electronic resource] ] : 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings / / edited by Erzsébet Csuhaj-Varjú, Zoltán Ésik
| Fundamentals of Computation Theory [[electronic resource] ] : 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings / / edited by Erzsébet Csuhaj-Varjú, Zoltán Ésik |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XIV, 510 p.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Machine theory Computer graphics Computer science—Mathematics Discrete mathematics Theory of Computation Formal Languages and Automata Theory Computer Graphics Discrete Mathematics in Computer Science |
| ISBN | 3-540-74240-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNISA-996465928003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Fundamentals of Computation Theory : 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings / / edited by Erzsébet Csuhaj-Varjú, Zoltán Ésik
| Fundamentals of Computation Theory : 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings / / edited by Erzsébet Csuhaj-Varjú, Zoltán Ésik |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XIV, 510 p.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Machine theory Computer graphics Computer science—Mathematics Discrete mathematics Theory of Computation Formal Languages and Automata Theory Computer Graphics Discrete Mathematics in Computer Science |
| ISBN | 3-540-74240-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNINA-9910768448903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Language, Life, Limits : 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014, Proceedings / / edited by Arnold Beckmann, Ersébet Csuhaj-Varjú, Klaus Meer
| Language, Life, Limits : 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014, Proceedings / / edited by Arnold Beckmann, Ersébet Csuhaj-Varjú, Klaus Meer |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XIV, 410 p. 33 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer science - Mathematics Theory of Computation Mathematics of Computing |
| ISBN | 3-319-08019-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | How can Grammatical Inference Contribute to Computational Linguistics? -- Algorithms and Their Explanations -- Gene Tree Correction by Leaf Removal and Modification: Tractability and Approximability -- Uniform Schemata for Proof Rules -- Graph Polynomials Motivated by Gene Rearrangements in Ciliates -- On the Equivalence of Automata for KAT-expressions -- Algorithmic Randomness for Infinite Time Register Machines -- Constraint Logic Programming for Resolution of Relative Time Expressions -- Maximal Parallelism in Membrane Systems with Generated Membrane Boundaries -- Learnability Thesis Does Not Entail Church’s Thesis -- Phase Transitions Related to the Pigeonhole Principle -- Generic Parallel Algorithms -- Fit-Preserving Data Refinement of Mass-Action Reaction Networks -- On Maximal Block Functions of Computable η-like Linear Orderings -- Lossiness of Communication Channels Modeled by Transducers -- Predicate Characterizations in the Polynomial-Size Hierarchy -- Function Spaces for Second-Order Polynomial Time -- Complexity of Operation Problems. |
| Record Nr. | UNINA-9910483142603321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Mathematical Foundations of Computer Science 2014 : 39th International Symposium, MFCS 2014, Budapest, Hungary, August 26-29, 2014. Proceedings, Part II / / edited by Ersébet Csuhaj-Varjú, Martin Dietzfelbinger, Zoltán Ésik
| Mathematical Foundations of Computer Science 2014 : 39th International Symposium, MFCS 2014, Budapest, Hungary, August 26-29, 2014. Proceedings, Part II / / edited by Ersébet Csuhaj-Varjú, Martin Dietzfelbinger, Zoltán Ésik |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XXII, 640 p. 71 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Machine theory Discrete Mathematics in Computer Science Numerical Analysis Data Science Formal Languages and Automata Theory Mathematical Applications in Computer Science |
| ISBN | 3-662-44465-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Table of Contents - Volume II -- Algorithms, Complexity and Games -- On r-Simple k-Path -- Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs -- Zero Knowledge and Circuit Minimization -- A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity -- n)-Space and Polynomial-time Algorithm for Planar Directed Graph Reachability -- Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set -- Network-Based Dissolution -- On Unification of QBF Resolution-Based Calculi -- Minimum planar multi-sink cuts with connectivity priors -- The Price of Envy-Freeness in Machine Scheduling -- On the Complexity of Some Ordering Problems -- The Relationship Between Multiplicative Complexity and Nonlinearity -- Find Dual Connectedness of Edge-Bicolored Graphs and Beyond -- Combinatorial Voter Control in Elections -- An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas -- On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields -- Hitting forbidden subgraphs in graphs of bounded treewidth -- Probabilistic Analysis of Power Assignments -- Existence of Secure Equilibrium in Multi-Player Games with Perfect Information -- An efficient quantum algorithm for finding hidden parabolic subgroups in the general linear group -- A Note on the Minimum Distance of Quantum LDPC Codes -- Minimum Bisection is NP-hard on Unit Disk Graphs -- Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty -- Streaming Kernelization -- A Reconfigurations Analogue of Brooks’ Theorem -- Intersection Graphs of L-Shapes and Segments in the Plane -- Autoreducibility and Mitoticity of Logspace-Complete Sets for NP and Other Classes -- Editing to a Connected Graph of Given Degrees -- Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth -- On Characterizations of Randomized Computation Using Plain Kolmogorov Complexity -- New Results for Non-Preemptive Speed Scaling -- Lower bounds for splittings by linear combinations -- On the Complexity of List Ranking in the Parallel External Memory Model -- Knocking Out Pk-free Graphs -- Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis -- Affine consistency and the complexity of semilinear constraints -- Small complexity classes for computable analysis -- Two Results about Quantum Messages -- Parameterized Approximations via d-Skew-Symmetric Multicut -- On the Clique Editing Problem -- On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic -- Computational Complexity of Covering Three-Vertex Multigraphs -- Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs -- On Coloring Resilient Graphs -- Document Retrieval with One Wildcard -- An Hn=2 Upper Bound on the Price of Stability of Undirected Network Design Games -- Traveling Salesman Problems in Temporal Graphs -- Inferring Strings from Lyndon factorization -- Betweenness Centrality - Incremental and Faster -- Deterministic Parameterized Algorithms for the Graph Motif Problem -- The Two Queries Assumption and Arthur-Merlin Classes -- Flexible Bandwidth Assignment with Application to Optical Networks -- Approximation Algorithms For Bounded Color Matchings via Convex Decompositions. |
| Record Nr. | UNINA-9910483797303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Mathematical Foundations of Computer Science 2014 : 39th International Symposium, MFCS 2014, Budapest, Hungary, August 26-29, 2014. Proceedings, Part I / / edited by Ersébet Csuhaj-Varjú, Martin Dietzfelbinger, Zoltán Ésik
| Mathematical Foundations of Computer Science 2014 : 39th International Symposium, MFCS 2014, Budapest, Hungary, August 26-29, 2014. Proceedings, Part I / / edited by Ersébet Csuhaj-Varjú, Martin Dietzfelbinger, Zoltán Ésik |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XXVI, 561 p. 65 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Machine theory Discrete Mathematics in Computer Science Numerical Analysis Data Science Formal Languages and Automata Theory Mathematical Applications in Computer Science |
| ISBN | 3-662-44522-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Table of Contents - Volume I.-Invited contributions -- Partial-Observation Stochastic Reachability and Parity Games -- Every graph is easy or hard: dichotomy theorems for graph problems -- Computer Poker and Computational Game Theory -- Random Deterministic Automata -- Communication Complexity Theory: Thirty-Five Years of Set Disjointness -- What does the local structure of a planar graph tell us about its global structure? -- Logic, Semantics, Automata and Theory of Programming -- Choiceless Polynomial Time on structures with small Abelian colour Classes -- Sofic-Dyck shifts -- A Logical Characterization of Timed (non-)Regular Languages -- Asymptotic Monadic Second-Order Logic -- Towards Efficient Reasoning Under Guarded-based Disjunctive Existential Rules -- Alternating Parity Krivine Automata -- Advances in Parametric Real-Time Reasoning -- Universal Lyndon Words -- Subword complexity and decomposition of the set of factors -- Cyclic Complexity of Words -- Classifying Recognizable Infinitary Trace Languages Using Word Automata -- Bounded variable logic, parameterized logarithmic space, and Savitch’s Theorem -- An algebraic characterization of unary two-way transducers -- Size-Change Abstraction and Max-Plus Automata -- Alternating Vector Addition Systems with States -- Information Rate of Some Classes of Non-regular Languages: An Automata-theoretic Approach -- Relating Nominal and Higher-Order Rewriting -- Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures -- Two Recursively Inseparable Problems for Probabilistic Automata -- Monadic Second-Order Logic with Arbitrary Monadic Predicates -- Transforming two-way alternating finite automata to one-way nondeterministic automata -- Measure Properties of Game Tree Languages -- On Upper and Lower Bounds on the Length of Alternating Towers -- LaxF: Side Conditions and External Evidence as Monads -- The monoid of queue actions -- Undecidable properties of self-affine sets and multi-tape automata -- Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality -- A Unifying Approach for Multistack Pushdown Automata -- Definability and Transformations for Cost Logics and Automatic Structures -- Generalised Lyndon-Schützenberger Equations -- Complexity of Equivalence and Learning for Multiplicity Tree Automata -- Monadic datalog and regular tree pattern queries -- Model Checking Concurrent Recursive Programs using Temporal Logics -- Decidability of the interval temporal logic AABB over the rationals -- Reachability in Pushdown Register Automata -- A Generalization of the Łos-Tarski Preservation Theorem over Classes of Finite Structures -- Determinising Parity Automata -- Tight Bounds for Complementing Parity Automata -- On Infinite Words Determined by Indexed Languages -- A Pumping Lemma for Two-Way Finite Transducers -- Tractability Frontier for Dually-Closed Ord-Horn Quantified Constraint Satisfaction Problems -- The Dynamic Descriptive Complexity of k-Clique. |
| Record Nr. | UNINA-9910484249403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Membrane Computing : 13th International Conference, CMC 2012, Budapest, Hungary, August 28-31, 2012, Revised Selected Papers / / edited by Erzsebet Csuhaj-Varju, Marian Gheorghe, Grzegorz Rozenberg, Arto Salomaa, György Vaszil
| Membrane Computing : 13th International Conference, CMC 2012, Budapest, Hungary, August 28-31, 2012, Revised Selected Papers / / edited by Erzsebet Csuhaj-Varju, Marian Gheorghe, Grzegorz Rozenberg, Arto Salomaa, György Vaszil |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XII, 425 p. 104 illus.) |
| Disciplina | 006.3/842 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Software engineering Computers—History Image processing—Digital techniques Computer vision Theory of Computation Software Engineering History of Computing Computer Imaging, Vision, Pattern Recognition and Graphics |
| ISBN | 3-642-36751-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- (Tissue) P Systems with Decaying Objects -- Alan Turing and John von Neumann - Their Brains and Their Computers -- Turing’s Three Pioneering Initiatives and Their Interplays -- An Outline of MP Modeling Framework -- Turing Computability and Membrane Computing -- Membrane Systems and Hypercomputation -- Regular Papers -- Case-Study on the Influence of Noise to Log-Gain Principles for Flux Dynamic Discovery -- Asynchronous and Maximally Parallel Deterministic Controlled Non-cooperative P Systems Characterize NFIN and coNFIN -- Sequential P Systems with Regular Control -- Mobile Membranes with Objects on Surface as Colored Petri Nets -- On Structures and Behaviors of Spiking Neural P Systems and Petri Nets -- 2D P Colonies -- Fast Distributed DFS Solutions for Edge-Disjoint Paths in Digraphs -- A New Approach for Solving SAT by P Systems with Active Membranes -- Maintenance of Chronobiological Information by P System Mediated Assembly of Control Units for Oscillatory Waveforms and Frequency -- Spiking Neural P Systems with Functional Astrocytes -- The Efficiency of Tissue P Systems with Cell Separation Relies on the Environment -- DCBA: Simulating Population Dynamics P Systems with Proportional Object Distribution -- Membranes with Boundaries -- On Efficient Algorithms for SAT -- Multigraphical Membrane Systems Revisited -- An Analysis of Correlative and Static Causality in P Systems -- Sublinear-Space P Systems with Active Membranes -- Modelling Ecological Systems with the Calculus of Wrapped Compartments -- Observer/Interpreter P Systems -- Limits of the Power of Tissue P Systems with Cell Division -- Fast Hardware Implementations of P Systems. |
| Record Nr. | UNINA-9910739423603321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||