Podcast #128: We chat with Kent C Dodds about why he loves React and discuss what life was like in the dark days before Git. Listen now.
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Favorites infavorites:mine
infavorites:1234
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with Search options user 41511

Questions related to the (computational) complexity of solving problems

1
vote
To expand a bit on Yuval Filmus' answer: Here ∀x seems to imply that universe is already predefined to refer to vertices only. Is this correct understanding? Yes. Implicitly, descriptive comple …
answered Jun 3 '18 by Words Like Jared
4
votes
4answers
Is $Ω(n\log n)$ the lower-bound for all sorting algorithms or just comparison-based sorting algorithms? If the latter, is it possible for there to be general-purpose sorting algorithms which perform …
asked Nov 26 '17 by Words Like Jared
2
votes
1answer
According to the Wikipedia page on Descriptive complexity theory: In the presence of linear order, first-order logic with a least fixed point operator gives P, the problems solvable in determinist …
asked Nov 30 '17 by Words Like Jared