Theoretical Computer Science
slkpg
  • Member for 10 years, 5 months
  • Last seen more than 5 years ago
Profile Activity
Stats
63
reputation
3k
reached
1
answer
2
questions
Communities
About

Proof that P≠NP: http://www.slkpg.com/NPcoNP.html

SLK Parser Generator: http://www.slkpg.com

"C With Structs" http://www.slkpg.com/cstructs.html

"Instance Model Programming" http://www.slkpg.com/instance.html

"NP is not equal to coNP" http://www.slkpg.com/NPcoNP.html

Android set max brightness http://www.slkpg.com/programs2.html

CS PhD in parsing theory and implementation

Badges
This user doesn’t have any gold badges yet.
This user doesn’t have any silver badges yet.
5
bronze badges
Top tags
2
Score
3
Posts
100
Posts %
2
Score
3
Posts
100
Posts %
Top posts
All Questions Answers
Votes Newest
3
Is state splitting the LR equivalent of LL nonterminal replication
Mar 25 '12
2
Determine if a LL(2) grammar is strong
Aug 23 '11
0
Classification of Saturated LL(1) Grammars
Nov 20 '11
Top network posts
View all network posts
5
Seems like NP cannot equal coNP by the definition of NP

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.