The proceedings contain 56 papers. The special focus in this conference is on Extensions of logicprogramming. The topics include: A new approach to making programs more reliable;searching among intervals and compact ...
ISBN:
(纸本)9783540569398
The proceedings contain 56 papers. The special focus in this conference is on Extensions of logicprogramming. The topics include: A new approach to making programs more reliable;searching among intervals and compact routing tables;the approximation of maximum subgraph problems;polynomially bounded minimization problems which are hard to approximate;primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover;the complexity of approximating pspace-complete problems for hierarchical specifications;problems on pairs of trees and the four colour problem of planar graphs;constructing competitive tours from local information;treewidth and pathwidth of permutation graphs;a theory of even functionals and their algorithmic applications;exact asymptotics of divide-and-conquer recurrences;optimal bounds for the change-making problem;the complexity of n-body simulation;a simple method for resolving degeneracies in delaunay triangulations;fault-tolerance and complexity;reversal-space trade-offs for simultaneous resource-bounded nondeterministic turing machines;on the computational power of discrete hopfield nets;on randomized versus deterministic computation;lower bounds for one-way probabilistic communication complexity;maintaining discrete probability distributions optimally;computational depth and reducibility;admissible, co-finite, and hypersimple languages;inclusion is undecidable for pattern languages;new decidability results concerning two-way counter machines and applications;cobham's theorem seen through büchi's theorem;logical definability on infinite traces;algebras for classifying regular tree languages and an application to frontier testability;finite automata as characterizations of minor closed tree families and on distributed algorithms in a broadcast domain.
暂无评论