19 Jul 2022
Are there any problems whose best known algorithms have running time $n^{\log \log n}$? cstheory.stackexchange.com/q… #complexityclasses
2
20 Dec 2021
Bounty offered: Complexity of type inference in the simply typed lambda calculus cstheory.stackexchange.com/q… #complexityclasses
2
11 Dec 2019
And if you ever thought that "complexity theory" should be made "categorical" -- then please take a look. Comments most welcome. Revised version of paper with Umut Isik.
arxiv.org/pdf/1610.07737.pdf
#categorytheory #complexityclasses
1
22 Apr 2019
Is there a relation between BBH (black box hypothesis) and SETH (strong exponential time ... cstheory.stackexchange.com/q… #complexityclasses
1
4
31 Aug 2017
What are examples of complexity classes that have contradictory relativizations but they ... cstheory.stackexchange.com/q… #complexityclasses
5 Aug 2017
#missbumbum @#amandaafernandess2# #model# ... - brazilbumbum.com/amandaafern… #ComplexityClasses #FiniteModelTheory #Instagram #MathematicalLogic
1
28 Oct 2016
Can you answer this? XOR-SAT to Horn-SAT reduction cstheory.stackexchange.com/q… #complexityclasses
19 Nov 2015
Can you answer this? Conjecture: All FPT NP-complete languages are fixed-parameter-isomorphic cstheory.stackexchange.com/q… #complexityclasses
13 Nov 2015
Problems can be solved in quasi-polynomial time, but not in polynomial time cstheory.stackexchange.com/q… #complexityclasses
25 Oct 2015
What's the complexity of counting odd nodes in graph? cstheory.stackexchange.com/q… #complexityclasses
1