Ales pultr (42 resultados)

Condición: New.

Condición: New.

Condición: As New. Unread book in perfect condition.

Paperback. Condición: Very Good. Estado de la sobrecubierta: No d/j as Published. Type: Book Plain label inside cover.

Bibl.Ex., keine Markierungen-Unterstreichungen-Anmerkungen im Text, Format groß 8°, 716 Seiten, broschiert, Stempel Vorsatz/Kopfschnitt, sonst wie neu. Shipping to abroad insured with tracking number.

Condición: New.

Condición: New. In English.

Hardcover. First Thus edition. Very Good-/No Jacket (10442) 1969 Academic Press hardcover, translation of 1966 2nd Czech ed. No dust jacket. A few smudges on boards. Linen tape on hinges, binding sound. No marks. Titles bright. NOT ex-library. Attractive. . 271.

Condición: As New. Unread book in perfect condition.

Hardcover. First Thus edition. Very Good/No Jacket (22584) 1969 Academic Press hardcover, translation of 1966 2nd Czech ed. No dust jacket. A few smudges on boards. No marks except for owner signature on endpaper. Titles bright. NOT ex-library. Attractive. . 271.

Condición: New. pp. 420.

Paperback. Condición: Brand New. 2012 edition. 417 pages. 9.50x6.50x0.75 inches. In Stock.

Condición: New. A brand new book in pristine condition. Showing zero signs of shelf wear, creases, or damage.

paperback. Condición: Gut. 740 Seiten; 9783540424963.3 Gewicht in Gramm: 2.

Paperback. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condición: New.

Condición: New. In English.

Condición: New. In English.

Condición: New. In English.

Condición: New.

Taschenbuch. Condición: 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.…

Condición: New. pp. 736.

Condición: As New. Unread book in perfect condition.

Hardback. Condición: New. 2021 ed. This book is the first systematic treatment of this area so far scattered in a vast number of articles. As in classical topology, concrete problems require restricting the (generalized point-free) spaces by various conditions playing the roles of classical separation axioms. These are typically formulated in the language of points; but in the point-free context one has either suitable translations, parallels, or satisfactory replacements. The interrelations of separation type conditions, their merits, advantages and disadvantages, and consequences are discussed. Highlights of the book include a treatment of the merits and consequences of subfitness, various approaches to the Hausdorff's axiom, and normality type axioms. Global treatment of the separation conditions put them in a new perspective, and, a.o., gave some of them unexpected importance. The text contains a lot of quite recent results; the reader will see the directions the area is taking, and may find inspirationfor her/his further work.The book will be of use for researchers already active in the area, but also for those interested in this growing field (sometimes even penetrating into some parts of theoretical computer science), for graduate and PhD students, and others. For the reader's convenience, the text is supplemented with an Appendix containing necessary background on posets, frames and locales.…

Condición: New. 1st ed. 2021 edition NO-PA16APR2015-KAP.

Condición: New.

Paperback. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condición: As New. Unread book in perfect condition.

Hardback. Condición: New. 2021 ed. This book is the first systematic treatment of this area so far scattered in a vast number of articles. As in classical topology, concrete problems require restricting the (generalized point-free) spaces by various conditions playing the roles of classical separation axioms. These are typically formulated in the language of points; but in the point-free context one has either suitable translations, parallels, or satisfactory replacements. The interrelations of separation type conditions, their merits, advantages and disadvantages, and consequences are discussed. Highlights of the book include a treatment of the merits and consequences of subfitness, various approaches to the Hausdorff's axiom, and normality type axioms. Global treatment of the separation conditions put them in a new perspective, and, a.o., gave some of them unexpected importance. The text contains a lot of quite recent results; the reader will see the directions the area is taking, and may find inspirationfor her/his further work.The book will be of use for researchers already active in the area, but also for those interested in this growing field (sometimes even penetrating into some parts of theoretical computer science), for graduate and PhD students, and others. For the reader's convenience, the text is supplemented with an Appendix containing necessary background on posets, frames and locales.…

Condición: 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.