<--- Back to Details
First PageDocument Content
Ethology / Parameterized complexity / Darwin–Wedgwood family / Fellows of the Royal Society / Charles Darwin University / Computational complexity theory / Charles Darwin / Largest-scale trends in evolution / Northern Territory / Science / Michael Fellows / Academia
Date: 2012-09-17 04:51:39
Ethology
Parameterized complexity
Darwin–Wedgwood family
Fellows of the Royal Society
Charles Darwin University
Computational complexity theory
Charles Darwin
Largest-scale trends in evolution
Northern Territory
Science
Michael Fellows
Academia

Sponsored by Charles Darwin University (CDU), Northern Territory, AUSTRALIA PARAMETERIZED COMPLEXITY: NOT-ABOUT-GRAPHS! See website: www.cdu.edu.au/parameterized-nag and below. DESCRIPTION To date, much of the work in p

Add to Reading List

Source URL: fpt.wdfiles.com

Download Document from Source Website

File Size: 83,53 KB

Share Document on Facebook

Similar Documents

Notes on Computational Complexity Theory CPSC: Spring 2017 James Aspnes:25

Notes on Computational Complexity Theory CPSC: Spring 2017 James Aspnes:25

DocID: 1uCk4 - View Document

On the notion of bit complexity Claus Diem August 21, 2010 Abstract In many works in the fields of computational complexity, algorithmic number theory and mathematical cryptology as well as in related areas, claims on th

On the notion of bit complexity Claus Diem August 21, 2010 Abstract In many works in the fields of computational complexity, algorithmic number theory and mathematical cryptology as well as in related areas, claims on th

DocID: 1uruF - View Document

Madhu Sudan Gordon McKay Professor, John A. Paulson School of Engineering and Applied Sciences, Harvard University Areas of Special Interests Theory of Computing, Algorithms, Computational Complexity, Reliable Communicat

Madhu Sudan Gordon McKay Professor, John A. Paulson School of Engineering and Applied Sciences, Harvard University Areas of Special Interests Theory of Computing, Algorithms, Computational Complexity, Reliable Communicat

DocID: 1ulr8 - View Document

Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs Marek Karpi´ nski1, , Andrzej Ruci´ nski2, , and Edyta Szyma´ nska2,  

Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs Marek Karpi´ nski1, , Andrzej Ruci´ nski2, , and Edyta Szyma´ nska2,  

DocID: 1tW23 - View Document

Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester

Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester

DocID: 1ruap - View Document