Theoretical Computer Science
Bartosz Bednarczyk's user avatar
Bartosz Bednarczyk's user avatar
Bartosz Bednarczyk's user avatar
Bartosz Bednarczyk
  • Member for 8 years, 4 months
  • Last seen this week
Profile Activity
Stats
1,320
reputation
9k
reached
18
answers
6
questions
top 6% this quarter
Communities
View all
About

PhD student at TU Dresden & University of Wrocław.

Badges
View all badges
1
gold badge
12
silver badges
17
bronze badges
Top tags
View all tags
33
Score
9
Posts
38
Posts %
32
Score
3
Posts
12
Posts %
22
Score
6
Posts
25
Posts %
12
Score
4
Posts
17
Posts %
9
Score
2
Posts
8
Posts %
6
Score
2
Posts
8
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
27
Is Descriptive Complexity dead?
Nov 27, 2020
answer
11
Existing implementation of Scott's reduction?
Jul 30, 2020
answer
9
Decidability of diophantine equations over {=, +, gcd}
Dec 27, 2020
question
8
Complexity of modal logic IK5
Feb 2, 2018
question
7
Uniform mortality problem for Turing Machines
Apr 25, 2019
question
7
For a given binary-search tree obtain an isomorphic splay tree
Aug 28, 2016
question
6
What is the impact of encodings of sparse structures on the complexity of the model checking problem?
Aug 10, 2021
question
5
Reference request: An algebraic characterisation of LTL[XF]-definable word languages
May 24, 2021
answer
5
Is Scott's reduction sound for $\mathrm{FO}^2$ with equality?
Aug 9, 2020
answer
5
Which are the best universities for a DPhil/PhD in proof theory and automated reasoning?
Oct 15, 2020
Top network posts
View all network posts
6
Failure of Łoś-Tarski preservation theorem for some equality-free logic

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.