Luke Mathieson

807 reputation

110

bio	website	comp.mq.edu.au/~lmathies
	location	Australia
	age	32
visits	member for	10 months
	seen	9 hours ago
stats	profile views	28

I'm a postdoc working on a big mess of different things, but all related by the use of parameterized complexity to help deal with hard problems. Mostly they're graph problems, but they come from all over the place. I'm also very interested in the structure of and relationships between complexity classes, especially in how they capture different, independent aspects of computation and its complexity.

	807 reputation	bio	website	comp.mq.edu.au/~lmathies	visits	member for	10 months
110 badges		location	Australia		seen	9 hours ago

summary answers questions tags badges favorites bounties reputation activity

33 Answers

votes activity newest

4	Complement of NP-Complete
4	Prove complement of this 12-vertex graph is a tree
3	Given the graphic sequence of a simple graph, how to construct the adjacency matrix?
3	Write a Context Free Grammar for L = {x#y \| x =/= reverse of y}
3	how can I solve for $x$?

807 Reputation

+25	Are regular languages necessarily deterministic context-free languages?
+25	Miller-Rabin Primality Test
+2	Miller-Rabin Primality Test
+10	Can you find function which satisfies $f(ab)=\frac{f(a)}{f(b)}$?

0 Questions

votes activity newest

This user has not asked any questions

33 Tags

16 graph-theory × 10	4 reference-request × 2
8 homework × 6	4 formal-languages × 2
7 computational-complexity × 5	4 computational-mathematics
6 context-free-grammar × 4	3 np-complete × 5
4 algorithms × 4	3 computer-science × 4

8 Accounts

	Computer Science	3,546 rep	220
	Academia	1,196 rep	113
$Mathematics Stack Exchange$	Mathematics	807 rep	110
	Theoretical Computer Science	656 rep	215
	Stack Overflow	101 rep	2