Home > Computing and Information Technology > Computer science > Mathematical theory of computation > Fundamentals of Computation Theory: 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001. Proceedings(2138 Lecture Notes in Computer Science)
36%
Fundamentals of Computation Theory: 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001. Proceedings(2138 Lecture Notes in Computer Science)

Fundamentals of Computation Theory: 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001. Proceedings(2138 Lecture Notes in Computer Science)

          
5
4
3
2
1

Available


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Quantity:
Add to Wishlist

About the Book

ThesymposiaonFundamentalsofComputationTheoryareheldeverytwoyears. Following the tradition established at the ?rst FCT 1977, the conference brings together specialists in theoretical ?elds of Computer Science from various co- tries and stimulates mathematical research in theoretical computer science. - pics of interest for the satellite workshop onE?cientAlgorithms WEA2001 are: computational complexity, graph and network algorithms, ?ow and routing - gorithms,coloringandpartitioning,cutsandconnectivity,packingandcovering, scheduling algorithms, approximation algorithms, inapproximability results, - line problems, randomized algorithms, integer programming, semide?nite p- gramming, algorithmic geometry, polyhedral combinatorics, branch and bound algorithms, cutting plane algorithms, and various applications. The 13th FCT was held in Riga-Lielupe, August 22-24, 2001 with an - ditional day (August 25) for the satellite workshop WEA2001. The previous meetings were held in the following cities: - Poznan-K' ornik, Poland, 1977 - Wendish-Rietz, Germany, 1979 - Szeged, Hungary, 1981 - Borgholm, Sweden, 1983 - Cottbus, Germany, 1985 - Kazan, Russia, 1987 - Szeged, Hungary, 1989 - Gosen-Berlin, Germany, 1991 - Szeged, Hungary, 1993 - Dresden, Germany, 1995 - Krak' ow, Poland, 1997 - Iasi, Romania, 1999 Thisyearthenumberofsubmittedpaperswashigh.TheProgramCommittee decided to accept 28 submissions as regular papers and 15 submissions as short papers. Additionally, the Program Committee of WEA2001 accepted 8 papers.

Table of Contents:
Invited Papers.- Towards Axiomatic Basis of Inductive Inference.- Approximation Algorithms for Fractional Covering and Packing Problems, and Applications.- Challenges of Commutation.- Approximating Bounded Degree Instances of NP-Hard Problems.- Universal Algebra and Computer Science.- Quantum Algorithms.- Regular Papers.- A Discrete Approximation and Communication Complexity Approach to the Superposition Problem.- On Computational Power of Quantum Branching Programs.- Efficient Computation of Singular Moduli with Application in Cryptography.- Ambainis-Freivalds’ Algorithm for Measure-Once Automata.- Are There Essentially Incomplete Knowledge Representation Systems?.- Best Increments for the Average Case of Shellsort.- Approximating Minimum Cocolourings.- Curved Edge Routing.- Time/Space Efficient Compressed Pattern Matching.- Modelling Change with the Aid of Knowledge and Time.- If P ? NP then Some Strongly Noninvertible Functions Are Invertible.- Prediction-Preserving Reducibility with Membership Queries on Formal Languages.- Dense Families and Key Functions of Database Relation Instances.- On the Complexity of Decidable Cases of Commutation Problem for Languages.- Cones, Semi-AFPs, and AFPs of Algebraic Power Series.- New Small Universal Circular Post Machines.- Divisibility Monoids: Presentation, Word Problem, and Rational Languages.- Concurrency in Timed Automata.- How Powerful Are Infinite Time Machines?.- Equivalence Problem of Composite Class Diagrams.- Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2.- On the Category of Event Structures with Dense Time.- Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions.- Monte-Carlo Polynomial versus Linear Time - The Truth-Table Case.-Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies.- Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables.- Piecewise and Local Threshold Testability of DFA.- Compositional Homomorphisms of Relational Structures.- Short Papers.- Representation of Autonomous Automata.- Quantum Reversibility and a New Model of Quantum Automaton.- Space-Efficient 1.5-Way Quantum Turing Machine.- A Combinatorial Aggregation Algorithm for Stationary Distribution of a Large Markov Chain.- A Primitive for Proving the Security of Every Bit and about Universal Hash Functions & Hard Core Bits.- Pythagorean Triples in Unification Theory of Nilpotent Rings.- Two-States Bilinear Intrinsically Universal Cellular Automata.- Linear Time Recognizer for Subsets of ?2.- Fuzzy Sets and Algorithms of Distributed Task Allocation for Cooperative Agents.- On Recursively Enumerable Subsets of N and Rees Matrix Semigroups over (Z3 ; + ).- Quantum Real - Time Turing Machine.- Mathematical Models and Optimal Algorithms of Dynamic Data Structure Control.- Linear Automata and Recognizable Subsets in Free Semirings.- On Logical Method for Counting Dedekind Numbers.- A General Method for Graph Isomorphism.- WEA Invited Papers.- Designing PTASs for MIN-SUM Scheduling Problems.- On Robust Algorithms for the Maximum Weight Stable Set Problem.- Multicasting in Optical Networks.- WEA Regular Papers.- Structured Randomized Rounding and Coloring.- Optimal Online Flow Time with Resource Augmentation.- New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs.- On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks.- Approximation Algorithms for Time-Dependent Orienteering.- On Complexityof Colouring Mixed Hypertrees.- Combining Arithmetic and Geometric Rounding Techniques for Knapsack Problems.- The Complexity of Maximum Matroid-Greedoid Intersection.


Best Sellers


Product Details
  • ISBN-13: 9783540424871
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 233 mm
  • No of Pages: 550
  • Series Title: 2138 Lecture Notes in Computer Science
  • Sub Title: 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001. Proceedings
  • Width: 155 mm
  • ISBN-10: 3540424873
  • Publisher Date: 03 Aug 2001
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Spine Width: 29 mm
  • Weight: 779 gr


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Fundamentals of Computation Theory: 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001. Proceedings(2138 Lecture Notes in Computer Science)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Fundamentals of Computation Theory: 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001. Proceedings(2138 Lecture Notes in Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Fundamentals of Computation Theory: 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001. Proceedings(2138 Lecture Notes in Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA