Computer Science
Michael Wehar
  • Member for 6 years, 10 months
  • Last seen more than a month ago
Profile Activity
Stats
236
reputation
3k
reached
2
answers
1
question
Communities
View all
About

  • I am enthusiastic about automata theory.

  • I ran in the 2018 cstheory moderator election and lost by two votes.

  • Here is a short article that I wrote on "What to do if you have a proposed solution to P vs NP?" https://github.com/MichaelWehar/P-vs-NP-Community

Thank you for stopping by and please always feel welcome to contact me! :)

Badges
View all badges
This user doesn’t have any gold badges yet.
2
silver badges
12
bronze badges
Top tags
View all tags
15
Score
2
Posts
67
Posts %
9
Score
1
Posts
33
Posts %
9
Score
1
Posts
33
Posts %
9
Score
1
Posts
33
Posts %
9
Score
1
Posts
33
Posts %
6
Score
1
Posts
33
Posts %
Top posts
All Questions Answers Articles
Votes Newest
9
space complexity of DFA intersection problem
Nov 8 '15
7
Is there any strategy to brute force search?
Oct 14 '15
6
What is the complexity of the emptiness problem for 2-way DFAs?
Oct 22 '15
Top Meta posts
1
0
10
Should Computer Science Meta start doing weekly AMA's?
Top network posts
View all network posts
24
Finding the smallest DFA that separates two words without using brute force search?
24
Deciding emptiness of intersection of regular languages in subquadratic time
24
Are there any open problems left about DFAs?
20
What is the minimum complexity oracle that separates PSPACE from the polynomial hierarchy?
19
Is there a non-deterministic linear time algorithm for CNF-SAT?

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.