Heykuki News
Top
New
Best
Ask
Show
Jobs
Toggle theme
Login
Top
New
Best
Ask
Show
Jobs
61.
▲
Fifty Years of P vs. NP and the Possibility of the Impossible
(blog.computationalcomplexity.org)
3 points
furcyd
4 years ago
discuss
62.
▲
Slowest Sorting Algorithms
(blog.computationalcomplexity.org)
3 points
furcyd
5 years ago
discuss
63.
▲
Length of Descriptions for DFA, NFA, CFG
(blog.computationalcomplexity.org)
3 points
furcyd
6 years ago
discuss
64.
▲
Paper from 2015 cracks Diffie-Hellman. What to tell the students?
(blog.computationalcomplexity.org)
3 points
furcyd
7 years ago
discuss
65.
▲
Can Mathematicians Fix iPhones? Can Anyone?
(blog.computationalcomplexity.org)
3 points
zdw
7 years ago
discuss
66.
▲
Computational Complexity:A Kolmogorov Complexity Proof of the Lovász Local Lemma
(blog.computationalcomplexity.org)
3 points
dilawar
9 years ago
discuss
67.
▲
Which name do you play for?
(blog.computationalcomplexity.org)
3 points
sp332
16 years ago
discuss
68.
▲
Pairs of Celebrities Born/Died on the Same Day
(blog.computationalcomplexity.org)
2 points
sp332
17 years ago
3 comments
69.
▲
The Betty White Award for 2023: Tommy Smothers
(blog.computationalcomplexity.org)
2 points
tapanjk
2 years ago
1 comment
70.
▲
AI tools cannot take such responsibility
(blog.computationalcomplexity.org)
2 points
zdw
3 years ago
1 comment
71.
▲
Positional Encoding
(blog.computationalcomplexity.org)
2 points
amichail
3 years ago
1 comment
72.
▲
Do the Physics Nobel Prize Winners Understand Their Own Work?
(blog.computationalcomplexity.org)
2 points
furcyd
4 years ago
1 comment
73.
▲
Computational Complexity: David Johnson (1945-2016)
(blog.computationalcomplexity.org)
2 points
ehudla
10 years ago
1 comment
74.
▲
Are patents and copyrights superfluous on the web?
(blog.computationalcomplexity.org)
2 points
amichail
17 years ago
discuss
75.
▲
The History of the History of the History of Computer Science
(blog.computationalcomplexity.org)
2 points
zdw
11 years ago
discuss
76.
▲
A Letter from Gödel to John von Neumann (March 20, 1956)
(blog.computationalcomplexity.org)
2 points
simonpure
12 years ago
discuss
77.
▲
More on the QIP = PSPACE result.
(blog.computationalcomplexity.org)
2 points
amichail
17 years ago
discuss
78.
▲
When is a paper public? When is anything public?
(blog.computationalcomplexity.org)
2 points
sp332
12 years ago
discuss
79.
▲
Are you smarter than a fifth grader? I'm not.
(blog.computationalcomplexity.org)
2 points
ddb
13 years ago
discuss
80.
▲
Maximum Flow finally in O(mn)
(blog.computationalcomplexity.org)
2 points
adrianN
14 years ago
discuss
81.
▲
Ridiculously hard proof of easy theorem
(blog.computationalcomplexity.org)
2 points
luu
14 years ago
discuss
82.
▲
AI and Research Papers
(blog.computationalcomplexity.org)
2 points
zdw
5 months ago
discuss
83.
▲
Clyde Kruskal talks about his Father Martin on Martin's 100th birthday
(blog.computationalcomplexity.org)
2 points
baruchel
8 months ago
discuss
84.
▲
Defending Theory
(blog.computationalcomplexity.org)
2 points
zdw
a year ago
discuss
85.
▲
Why did 1+1=2 take Russell and Whitehead 300 pages? (2011)
(blog.computationalcomplexity.org)
2 points
wslh
a year ago
discuss
86.
▲
Who first thought of the notion of polynomial time? (featuring the Columbus prin (2022)
(blog.computationalcomplexity.org)
2 points
fanf2
a year ago
discuss
87.
▲
Mihai Patrascu dies at 29
(blog.computationalcomplexity.org)
2 points
slothmaster
14 years ago
discuss
88.
▲
When is it worth the time and effort to verify a proof FORMALLY?
(blog.computationalcomplexity.org)
2 points
baruchel
2 years ago
discuss
89.
▲
The Engineer and the Computer Scientist
(blog.computationalcomplexity.org)
2 points
furcyd
3 years ago
discuss
90.
▲
Inverting a Function
(blog.computationalcomplexity.org)
2 points
beefman
3 years ago
discuss
More