Computer Science
Reiner Czerwinski's user avatar
Reiner Czerwinski's user avatar
Reiner Czerwinski's user avatar
Reiner Czerwinski
  • Member for 1 year, 11 months
  • Last seen more than a week ago
Profile Activity
Stats
180
reputation
17k
reached
12
answers
3
questions
Communities
Badges
This user doesn’t have any gold badges yet.
This user doesn’t have any silver badges yet.
6
bronze badges
Top tags
View all tags
7
Score
11
Posts
73
Posts %
2
Score
5
Posts
33
Posts %
2
Score
2
Posts
13
Posts %
2
Score
2
Posts
13
Posts %
2
Score
1
Posts
7
Posts %
1
Score
7
Posts
47
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
3
Question about the Relativization barrier
Dec 9, 2022
answer
2
What are some problems in EXPTIME not known to be EXPTIME-complete?
Jan 9, 2022
answer
2
What are some problems in EXP not known to be EXPTIME-Complete, but also do not have any known algorithm in NP?
Jan 9, 2022
answer
2
$\log_{2}{(\frac{1}{2}n)} + \log_{2}{(\frac{1}{4}n}) + \log_{2}{(\frac{1}{8}n)} + \ldots + \log_{2}{(\frac{1}{2^{log_{2}(n)}}n)} = O(\log_{2}(n))$?
Mar 14, 2022
answer
1
What's the complexity class of determing the halting problem of a finite memory Turing machine?
Jan 9, 2022
answer
1
What would be the conseuqences of BQP = NEXPTIME?
Jan 14, 2022
answer
1
Can we DISPROVE that a problem is NP-complete
Jan 16, 2022
answer
1
Would the P vs. NP problem become trivial as a result of the development of universal quantum computers?
Jan 3
question
0
P versus NP relative to a P-complete set
Feb 10
question
0
Is there an oracle $A$ with $P^A = NP^A$, but $EXP^A \not= NEXP^A$?
Sep 3

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.