|
Showing 1 - 4 of
4 matches in All Departments
|
Parameterized and Exact Computation - First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings (Paperback, 2004 ed.)
Frank Dehne, Rod Downey, Michael Fellows
|
R1,613
Discovery Miles 16 130
|
Ships in 10 - 15 working days
|
Thecentralchallengeoftheoreticalcomputerscienceistodeploymathematicsin
waysthatservethecreationofusefulalgorithms.
Inrecentyearstherehasbeena growinginterest in the
two-dimensionalframework of parameterizedcomplexity, where, in
addition to the overall input size, one also considers a parameter,
with a focus on how these two dimensions interact in problem
complexity. This book presents the proceedings of the 1st
InternationalWorkshopon - rameterized and Exact Computation (IWPEC
2004, http: //www. iwpec. org), which took place in Bergen, Norway,
on September 14-16, 2004. The workshop was organized as part of
ALGO 2004. There were seven previous workshops on the theory and
applications of parameterized complexity. The ?rst was - ganized at
the Institute for the Mathematical Sciences in Chennai, India, in
September, 2000. The second was held at Dagstuhl Castle, Germany,
in July, 2001. In December, 2002, a workshop on parameterized
complexity was held in conjunction with the FST-TCS meeting in
Kanpur, India. A second Dagstuhl workshop on parameterized
complexity was held in July, 2003. Another wo-
shoponthesubjectwasheldinOttawa, Canada, inAugust,2003,
inconjunction with the WADS 2003 meeting. There have also been two
Barbados workshops on applications of parameterized complexity. In
response to the IWPEC 2004 call for papers, 47 papers were
submitted, and from these the programcommittee selected 25 for
presentation at the wo- shop. Inaddition,
invitedlectureswereacceptedbythedistinguishedresearchers Michael
Langston and Gerhard Woe
The book contains 8 detailed expositions of the lectures given at
the Kaikoura 2000 Workshop on Computability, Complexity, and
Computational Algebra. Topics covered include basic models and
questions of complexity theory, the Blum-Shub-Smale model of
computation, probability theory applied to algorithmics (randomized
alogrithms), parametric complexity, Kolmogorov complexity of finite
strings, computational group theory, counting problems, and
canonical models of ZFC providing a solution to continuum
hypothesis. The text addresses students in computer science or
mathematics, and professionals in these areas who seek a complete,
but gentle introduction to a wide range of techniques, concepts,
and research horizons in the area of computational complexity in a
broad sense.
Computability theory is a branch of mathematical logic and computer
science that has become increasingly relevant in recent years. The
field has developed growing connections in diverse areas of
mathematics, with applications in topology, group theory, and other
subfields. In A Hierarchy of Turing Degrees, Rod Downey and Noam
Greenberg introduce a new hierarchy that allows them to classify
the combinatorics of constructions from many areas of computability
theory, including algorithmic randomness, Turing degrees,
effectively closed sets, and effective structure theory. This
unifying hierarchy gives rise to new natural definability results
for Turing degree classes, demonstrating how dynamic constructions
become reflected in definability. Downey and Greenberg present
numerous construction techniques involving high-level nonuniform
arguments, and their self-contained work is appropriate for
graduate students and researchers. Blending traditional and modern
research results in computability theory, A Hierarchy of Turing
Degrees establishes novel directions in the field.
Computability theory is a branch of mathematical logic and computer
science that has become increasingly relevant in recent years. The
field has developed growing connections in diverse areas of
mathematics, with applications in topology, group theory, and other
subfields. In A Hierarchy of Turing Degrees, Rod Downey and Noam
Greenberg introduce a new hierarchy that allows them to classify
the combinatorics of constructions from many areas of computability
theory, including algorithmic randomness, Turing degrees,
effectively closed sets, and effective structure theory. This
unifying hierarchy gives rise to new natural definability results
for Turing degree classes, demonstrating how dynamic constructions
become reflected in definability. Downey and Greenberg present
numerous construction techniques involving high-level nonuniform
arguments, and their self-contained work is appropriate for
graduate students and researchers. Blending traditional and modern
research results in computability theory, A Hierarchy of Turing
Degrees establishes novel directions in the field.
|
You may like...
Loot
Nadine Gordimer
Paperback
(2)
R398
R330
Discovery Miles 3 300
|