Parameterized Complexity

An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. The authors consider the problem in terms of parameterized languages and taking "k-slices" of the language, thus introducing readers to new classes of algorithms which may be analysed more precisely than was the case until now. The book is as self-contained as possible and includes a great deal of background material. As a result, computer scientists, mathematicians, and graduate students interested in the design and analysis of algorithms will find much of interest.

[1]  T. Chow.  What is a Closed-Form Number? , 1998, math/9805045.

[2]  Chuan Yi Tang,et al.  A 2.|E|-Bit Distributed Algorithm for the Directed Euler Trail Problem , 1993, Inf. Process. Lett..

[3]  David H. Bailey,et al.  Analysis of PSLQ, an integer relation finding algorithm , 1999, Math. Comput..

[4]  David Bailey,et al.  On the rapid computation of various polylogarithmic constants , 1997, Math. Comput..

[5]  Micha Sharir,et al.  Motion Planning in the Presence of Moving Obstacles , 1985, FOCS.

[6]  Michael R. Fellows,et al.  Parallel self-reducibility , 1992, Proceedings ICCI `92: Fourth International Conference on Computing and Information.

[7]  Michael R. Fellows,et al.  Fixed-parameter intractability , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[8]  Amir Pnueli,et al.  Checking that finite state concurrent programs satisfy their linear specification , 1985, POPL.

[9]  Michael R. Fellows,et al.  On the complexity and combinatorics of covering finite complexes , 1991, Australas. J Comb..

[10]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[11]  Rajeev Motwani,et al.  Towards a syntactic characterization of PTAS , 1996, STOC '96.

[12]  H. Poincaré,et al.  Les Méthodes nouvelles de la Mécanique céleste and An Introduction to the Study of Stellar Structure , 1958 .

[13]  Baruch Schieber,et al.  A Linear-time Algorithm for Computing the Intersection of All Odd Cycles in a Graph , 1997, Discret. Appl. Math..

[14]  Richard E. Crandall,et al.  New Representations for the Madelung Constant , 1999, Exp. Math..

[15]  Christopher Deninger,et al.  Deligne periods of mixed motives, -theory and the entropy of certain ℤⁿ-actions , 1997 .

[16]  Marco Cesati,et al.  Parameterized complexity analysis in robot motion planning , 1995, 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century.

[17]  Michael R. Fellows,et al.  Constructive complexity , 1991, Discret. Appl. Math..

[18]  Michel de Rougemont,et al.  On the Complexity of Partially Observed Markov Decision Processes , 1996, Theor. Comput. Sci..

[19]  Meena Mahajan,et al.  Parametrizing Above Guaranteed Values: MaxSat and MaxCut , 1997, Electron. Colloquium Comput. Complex..

[20]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues , 1995, Ann. Pure Appl. Log..

[21]  Micha Sharir,et al.  Algorithmic motion planning in robotics , 1991, Computer.

[22]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[23]  Jonathan M. Borwein,et al.  Pi and the AGM , 1999 .

[24]  Michael R. Fellows,et al.  Finite automata, bounded treewidth, and well-quasiordering , 1991, Graph Structure Theory.

[25]  Michael R. Fellows,et al.  On the complexity of fixed parameter problems , 1989, 30th Annual Symposium on Foundations of Computer Science.

[26]  Harry G. Mairson,et al.  The complexity of type inference for higher-order lambda calculi , 1991, POPL '91.

[27]  J. Reif.  Complexity of the Generalized Mover's Problem. , 1985 .

[28]  Luca Trevisan,et al.  On the Efficiency of Polynomial Time Approximation Schemes , 1997, Inf. Process. Lett..

[29]  Jonathan M. Borwein,et al.  Fast evaluation of the gamma function for small rational fractions using complete elliptic integrals of the first kind , 1992 .