Rodney Graham Downey (born 20 September 1957) is an Australian and New Zealand mathematician and computer scientist, a professor in the School ofâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Russell Miller
- Computability and Complexity
- 2017

Inspired by recent work of Csima and Harrison-Trainor and of MontalbÃ¡n in relativizing the notion of degrees of categoricity, weâ€¦Â (More)

Is this relevant?

2017

2017

- Computability and Complexity
- 2017

Â

Is this relevant?

Review

2015

Review

2015

- Rajesh Hemant Chitnis
- SIGACT News
- 2015

Most interesting optimization problems on graphs are NP-hard, which means that (unless P=NP) there is no polynomial timeâ€¦Â (More)

Is this relevant?

Review

2014

Review

2014

- Peter Lista, Fabio Rojas
- 2014

Uncertainty in an organizationâ€™s environment can have profound implications for its internal structure and decision-makingâ€¦Â (More)

Is this relevant?

2012

2012

In [3], Brodhead, Downey and Ng introduced some new variations of the notions of being Martin-LÃ¶f random where the tests are allâ€¦Â (More)

Is this relevant?

2009

2009

- Meng Tack Ng, Keng Meng Ng
- 2009

The concern of this paper is with effective packing dimension. This concept can be traced back to the work of Borel and Lebesgueâ€¦Â (More)

Is this relevant?

2009

2009

- John N. Cobb
- 2009

Acknowledgements There are many people who have helped to make this thesis a reality. First and foremost , I want to thank Drâ€¦Â (More)

Is this relevant?

Review

2009

Review

2009

Heuristic methods work often quite well on real-world instances of computational reasoning problems, contrasting the theoreticalâ€¦Â (More)

Is this relevant?

2007

2007

- Cai Leizhen
- 2007

Parameterized complexity is a framework developed mainly by Downey and Fellows [6] to deal with the complexity of a problem withâ€¦Â (More)

Is this relevant?

2005

2005

- Stefan Szeider
- Journal of Automated Reasoning
- 2005

We study the parameterized complexity of detecting small backdoor sets for instances of the propositional satisfiability problemâ€¦Â (More)

Is this relevant?