Kolman petr (11 Ergebnisse)

Zustand: New. In English.

Zustand: New. In English.

Paperback. Zustand: Brand New. revised edition. 355 pages. 9.30x6.10x0.80 inches. In Stock.

Paperback. Zustand: Brand New. 480 pages. 9.25x6.25x1.25 inches. In Stock.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The 7th Annual Conference on Theory and Applications of Models of Compu- tion was held during June 7 11, 2010 in Prague. After six successful conferences held in 2004 2009 in China (Beijing, Kunming, Beijing, Shanghai, Xi an, and ChangSha) TAMC left Asia for the rst time, aiming at the heart of Europe. Changingthegeographicallocationdidnotbringanychangestothescopeofthe conference. Its three main themes continued to be Computability, Complexity, and Algorithms. The conference aims to bring together researchersfrom all over the world with interests in theoretical computer science, algorithmic mathem- ics,andapplicationsto thephysicalsciences. Thisyearwesawmoreparticipants from Europe and the Americas, but we were very happy that we could also w- come to Prague traditional participants from Asia (China, Japan, and India) to continue enhancing the collaboration among the theoretical computer science communities of these continents. After hard work the Program Committee decided to accept 35 papers out of 76 submitted to TAMC 2010. Each submission was reviewed by at least three, Program Committee members. All actions of the Program Committee were - ordinated via awlessly and e ciently running EasyChair. We congratulate the authors of accepted contributions and thank all authors who submitted their papers. They all contributed to a successful event. We extend our thanks to the distinguished plenary speakers who accepted our invitation to deliver plenary talks John Hopcroft from Cornell University and Shang-Hua Teng from University of Southern California. Their talks New Research Directions in the Information Age and The Laplacian Paradigm: Emerging Algorithms for Massive Graph were highlights of the conference. …

paperback. Zustand: Gut. 740 Seiten; 9783540424963.3 Gewicht in Gramm: 2.

Zustand: New. In English.

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 496 | Sprache: Englisch | Produktart: Bücher | The 7th Annual Conference on Theory and Applications of Models of Compu- tion was held during June 7¿11, 2010 in Prague. After six successful conferences held in 2004¿2009 in China (Beijing, Kunming, Beijing, Shanghai, Xi¿an, and ChangSha) TAMC left Asia for the ?rst time, aiming at the ¿heart of Europe. ¿ Changingthegeographicallocationdidnotbringanychangestothescopeofthe conference. Its three main themes continued to be Computability, Complexity, and Algorithms. The conference aims to bring together researchersfrom all over the world with interests in theoretical computer science, algorithmic mathem- ics,andapplicationsto thephysicalsciences. Thisyearwesawmoreparticipants from Europe and the Americas, but we were very happy that we could also w- come to Prague traditional participants from Asia (China, Japan, and India) to continue enhancing the collaboration among the theoretical computer science communities of these continents. After hard work the Program Committee decided to accept 35 papers out of 76 submitted to TAMC 2010. Each submission was reviewed by at least three, Program Committee members. All actions of the Program Committee were - ordinated via ?awlessly and e?ciently running EasyChair. We congratulate the authors of accepted contributions and thank all authors who submitted their papers. They all contributed to a successful event. We extend our thanks to the distinguished plenary speakers who accepted our invitation to deliver plenary talks ¿ John Hopcroft from Cornell University and Shang-Hua Teng from University of Southern California. Their talks ¿New Research Directions in the Information Age¿ and ¿The Laplacian Paradigm: Emerging Algorithms for Massive Graph¿ were highlights of the conference. …

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 344 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Invited Talks.- A New Category for Semantics.- On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity.- Playing Games with Algorithms: Algorithmic Combinatorial Game Theory.- Some Recent Results on Data Mining and Search.- Hypertree Decompositions: A Survey.- The Strength of Non-size-increasing Computation (Introduction and Summary).- to Recent Quantum Algorithms.- Decomposition Methods and Sampling Circuits in the Cartesian Lattice.- New Algorithms for k-SAT Based on the Local Search Principle.- Linear Temporal Logic and Finite Semigroups.- Contributed Talks.- Refined Search Tree Technique for Dominating Set on Planar Graphs.- The Computational Power of a Family of Decision Forests.- Exact Results for Accepting Probabilities of Quantum Automata.- Improved Bounds on the Weak Pigeonhole Principle and Infinitely Many Primes from Weaker Axioms.- Analysis Problems for Sequential Dynamical Systems and Communicating State Machines.- The Complexity of Tensor Circuit Evaluation.- Computing Reciprocals of Bivariate Power Series.- Automatic Verification of Recursive Procedures with One Integer Parameter.- Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds.- Computable Versions of Baire's Category Theorem.- Automata on Linear Orderings.- Algorithmic Information Theory and Cellular Automata Dynamics.- The k-Median Problem for Directed Trees.- On Pseudorandom Generators in NC0.- There Are No Sparse NPw-Hard Sets.- Sharing One Secret vs. Sharing Many Secrets: Tight Bounds for the Max Improvement Ratio.- (H,C,K) -Coloring: Fast, Easy, and Hard Cases.- Randomness and Reductibility.- On the Computational Complexity of Infinite Words.- Lower Bounds for On-Line Single-Machine Scheduling.- Approximation Algorithms and Complexity Results forPath Problems in Trees of Rings.- A 3-Approximation Algorithm for Movement Minimization in Conveyor Flow Shop Processing.- Quantifier Rank for Parity of Embedded Finite Models.- Space Hierarchy Theorem Revised.- Converting Two-Way Nondeterministic Unary Automata into Simpler Automata.- The Complexity of the Minimal Polynomial.- Note on Minimal Finite Automata.- Synchronizing Finite Automata on Eulerian Digraphs.- A Time Hierarchy for Bounded One-Way Cellular Automata.- Checking Amalgamability Conditions forCasl Architectural Specifications.- On-Line Scheduling with Tight Deadlines.- Complexity Note on Mixed Hypergraphs.- News from the Online Traveling Repairman.- Word Problems for 2-Homogeneous Monoids and Symmetric Logspace.- Variations on a Theorem of Fine & Wilf.- Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs.- Satisfiability of Systems of Equations over Finite Monoids.- Rational Graphs Trace Context-Sensitive Languages.- Towards Regular Languages over Infinite Alphabets.- Partial Information and Special Case Algorithms.- The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs.- From Bidirectionality to Alternation.- Syntactic Semiring of a Language.- On Reducibility and Symmetry of Disjoint NP-Pairs.- Hierarchy of Monotonically Computable Real Numbers.- On the Equational Definition of the Least Prefixed Point.- On the Periods of Partial Words.- The Size of Power Automata.- On the Approximability of the Steiner Tree Problem.- Alignment between Two RNA Structures.- Characterization of Context-Free Languages with Polynomially Bounded Ambiguity.…

Zustand: gut. 2008. Mathematical Foundations of Computer Science 2001: 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001 . Notes in Computer Science, 2136, Band 2136) In deutscher Sprache. pages.