Übersicht			Auf mobile öffnen

Lieferstatus:	Auf Bestellung (Lieferzeit unbekannt)
Veröffentlichung:	September 2005
Genre:	EDV / Informatik
	Algorithm Analysis and Problem Complexity / Algorithmen und Datenstrukturen / Algorithms / Algorithms & data structures / C / Computation by Abstract Devices / Computer architecture & logic design / Computer logic / Computer programming / software engineering / computer science / Computer Science Logic and Foundations of Programming / Computers / Data Science / Data Structures / Data structures (Computer science) / Datenbanken / Formal Languages and Automata Theory / Logics and Meanings of Programs / Mathematical logic / Mathematical Logic and Formal Languages / Mathematical theory of computation / Theory of Computation mehr...
ISBN:	9783540291060
EAN-Code:	9783540291060
Verlag:	Springer EN
Einband:	Kartoniert
Sprache:	English
Serie:	#3701 - Lecture Notes in Computer Science Theoretical Computer Science and General Issues
Dimensionen:	H 235 mm / B 155 mm / D
Gewicht:	1330 gr
Seiten:	411
Illustration:	XI, 411 p.
Zus. Info:	EUDR exemption - product or manufacturing materials placed on the market prior to 31.12.2025.
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

Invited Contributions.- Semantic Subtyping: Challenges, Perspectives, and Open Problems.- Biological Systems as Reactive Systems.- Mobile Agents Computing: Security Issues and Algorithmic Solutions.- Technical Contributions.- Efficient Algorithms for Detecting Regular Point Configurations.- Pickup and Delivery for Moving Objects on Broken Lines.- A Static Analysis of PKI-Based Systems.- Subtyping Object and Recursive Types Logically.- The Language ?: Circuits, Computations and Classical Logic.- Checking Risky Events Is Enough for Local Policies.- The Graph Rewriting Calculus: Confluence and Expressiveness.- Safe Object Composition in the Presence of Subtyping.- Reachability Analysis in Boxed Ambients.- Error Mining for Regular Expression Patterns.- Reconstructing an Alternate Periodical Binary Matrix from Its Orthogonal Projections.- Inapproximability Results for the Lateral Gene Transfer Problem.- Faster Deterministic Wakeup in Multiple Access Channels.- Weighted Coloring: Further Complexity and Approximability Results.- Quantum Algorithms for a Set of Group Theoretic Problems.- On the Computational Complexity of the L (2,1)-Labeling Problem for Regular Graphs.- A Polymerase Based Algorithm for SAT.- Laxity Helps in Broadcast Scheduling.- Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory.- Synthesis from Temporal Specifications Using Preferred Answer Set Programming.- Model Checking Strategic Abilities of Agents Under Incomplete Information.- Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error.- A Theoretical Analysis of Alignment and Edit Problems for Trees.- A Complete Formulation of Generalized Affine Equivalence.- A New Combinatorial Approach to SequenceComparison.- A Typed Assembly Language for Non-interference.- Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems.- A Typed Semantics of Higher-Order Store and Subtyping.- Two Variables Are Not Enough.