Computer Science
lz9866's user avatar
lz9866's user avatar
lz9866's user avatar
lz9866
  • Member for 1 year, 5 months
  • Last seen this week
Profile Activity
Stats
195
reputation
4k
reached
0
answers
18
questions
Communities
View all
Badges
This user doesn’t have any gold badges yet.
1
silver badge
6
bronze badges
Top tags
View all tags
0
Score
12
Posts
67
Posts %
0
Score
8
Posts
44
Posts %
0
Score
7
Posts
39
Posts %
0
Score
7
Posts
39
Posts %
0
Score
4
Posts
22
Posts %
0
Score
4
Posts
22
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
12
Is there an algorithm whose time complexity is between polynomial time and exponential time？
Dec 22, 2021
question
2
Whether the class of languages with time complexity between polynomial and exponential is an NP language？
Jan 31
question
1
Can you help me provide some examples of 3-co-SAT?
Oct 14, 2021
question
1
what does **input** mean for the $3SAT$ question? Is it the number of variables $n$ or the number of clauses $m$
May 30, 2022
question
1
I would like to know what are the directions to work on if I want to prove that $NP=coNP$?
Mar 18
question
0
For Turing machines, if the input variables increase, will the state set Q increase ? will the tape alphabet Γ increase?
Oct 1, 2021
question
0
For 3CNF unsatisfiable boolean formulas, does it take exponential time to transform them into disjunctive form？
Nov 11, 2021
question
0
Where are some examples of unsatisfiable formulas? Especially about 3CNF paradigm
May 9, 2022
question
0
Does a language have the same time complexity as its complement language?
Nov 11, 2022
question
0
Are all languages determined in exponential time NP languages?
Jan 15

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.