Logic and Machines: Decision Problems and Complexity
E. Börger
Sold by BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
AbeBooks Seller since January 11, 2012
New - Soft cover
Condition: New
Quantity: 2 available
Add to basketSold by BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
AbeBooks Seller since January 11, 2012
Condition: New
Quantity: 2 available
Add to basketThis item is printed on demand - it takes 3-4 days longer - Neuware -InhaltsangabeP-mitotic sets.- Equivalence relations, invariants, and normal forms, II.- Recurrence relations for the number of labeled structures on a finite set.- Recursively enumerable extensions of R1 by finite functions.- On the complement of one complexity class in another.- The length-problem.- On r.e. inseparability of CPO index sets.- Arithmetical degrees of index sets for complexity classes.- Rudimentary relations and Turing machines with linear alternation.- A critical-pair/completion algorithm for finitely generated ideals in rings.- Extensible algorithms.- Some reordering properties for inequality proof trees.- Modular decomposition of automata.- Modular machines, undecidability and incompleteness.- Universal Turing machines (UTM) and Jones-Matiyasevich-masking.- Complexity of loop-problems in normed networks.- On the solvability of the extended - Ackermann class with identity.- Reductions for the satisfiability with a simple interpretation of the predicate variable.- The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems).- Implicit definability of finite binary trees by sets of equations.- Spektralproblem and completeness of logical decision problems.- Reduction to NP-complete problems by interpretations.- Universal quantifiers and time complexity of random access machines.- Second order spectra.- On the argument complexity of multiply transitive Boolean functions.- The VLSI complexity of Boolean functions.- Fast parallel algorithms for finding all prime implicants for discrete functions.- Bounds for Hodes - Specker theorem.- Proving lower bounds on the monotone complexity of Boolean functions. 472 pp. Englisch.
Seller Inventory # 9783540133315
Allgemeine Geschäftsbedingungen mit Kundeninformationen
Inhaltsverzeichnis
Geltungsbereich
Vertragsschluss
Widerrufsrecht
Preise und Zahlungsbedingungen
Liefer- und Versandbedingungen
Eigentumsvorbehalt
Mängelhaftung
Anwendbares Recht
Gerichtsstand
Alternative Streitbeilegung
Der Versand ins Ausland findet IMMER mit DHL statt. Auch nach Österreich verschicken wir nur mit DHL! Daher Standardversand == Luftpost!
Order quantity | 5 to 15 business days | 5 to 15 business days |
---|---|---|
First item | US$ 26.89 | US$ 26.89 |
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.