Skip to main content
Scour
Browse
Getting Started
Login
Sign Up
You are offline. Trying to reconnect...
Copied to clipboard
Unable to share or copy to clipboard
Complexity Theory
🧩 Complexity Theory
computational complexity, NP-hard, P vs NP, algorithms
Filter Results
Timeframe
Fresh
Past Hour
Today
This Week
This Month
Feeds to Scour
Subscribed
All
Scoured
125
posts in
6.5
ms
A Proof on the
Computational
Complexity
of the Traveling Salesman
Problem
: Why P ≠ NP
🧮
SMT Solvers
zenodo.org
·
23h
23 hours ago
·
Hacker News
Actions for A Proof on the Computational Complexity of the Traveling Salesman Problem: Why P ≠ NP
Polynomial-time
satisfiability for a special case of Positive$\wedge$Negative
🧮
SMT Solvers
Content type:
Academic
arxiv.org
·
5d
5 days ago
Actions for Polynomial-time satisfiability for a special case of Positive$\wedge$Negative
The Future Is
Undecidable
. Duty Is Not.
∞
Computability
Content type:
Blog
dhanjit.me
·
2d
2 days ago
·
Hacker News
Actions for The Future Is Undecidable. Duty Is Not.
Remove Nth Node From End of List
🗂️
Vector Indexes
leetcode.com
·
15h
15 hours ago
·
DEV
Actions for Remove Nth Node From End of List
Achieving Shannon Capacity for
Computationally
Bounded Errors
🗜️
Compression Algorithms
eprint.iacr.org
·
1d
1 day ago
Actions for Achieving Shannon Capacity for Computationally Bounded Errors
Show HN:
TuringLLM
– a LLM-powered Universal Turing
machine
∞
Computability
Content type:
Code
github.com
·
5d
5 days ago
·
Hacker News
Actions for Show HN: TuringLLM – a LLM-powered Universal Turing machine
Turing
universal neural networks do not require global clocks
∞
Computability
Content type:
Academic
nature.com
·
5d
5 days ago
·
Hacker News
Actions for Turing universal neural networks do not require global clocks
Are Neural Networks Collision Resistant?
📏
ANN Benchmarks
link.aps.org
·
5d
5 days ago
Actions for Are Neural Networks Collision Resistant?
On the
Complexity
of Signed Domination
🔗
WCOJ
Content type:
Academic
arxiv.org
·
19h
19 hours ago
Actions for On the Complexity of Signed Domination
The Arithmetic Circuit Combinatorial Nullstellensatz is
NP-hard
🧮
SMT Solvers
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for The Arithmetic Circuit Combinatorial Nullstellensatz is NP-hard
Two Sum | HashMap Pattern
🔗
Combinatorics
leetcode.com
·
3d
3 days ago
·
DEV
Actions for Two Sum | HashMap Pattern
Discovering expert-level Nash equilibrium
algorithms
with large language models
🔗
WCOJ
Content type:
Academic
nature.com
·
6d
6 days ago
Actions for Discovering expert-level Nash equilibrium algorithms with large language models
A remark on diagnosability verification
📐
TLA+
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for A remark on diagnosability verification
Algebraic Cryptanalytic Extraction on
Hard-Label
Neural Networks
🧮
SMT Solvers
eprint.iacr.org
·
6d
6 days ago
Actions for Algebraic Cryptanalytic Extraction on Hard-Label Neural Networks
TiruArt/Pedigree-Polytopes-Lean4: Lean 4
machine-verified
proof that Membership
Problem
for Pedigree Polytopes, M3P ∈ P and P =
NP
via properties of Pedigree Polytopes.
📐
Mathematics
Content type:
Code
github.com
·
5d
5 days ago
·
Hacker News
Actions for TiruArt/Pedigree-Polytopes-Lean4: Lean 4 machine-verified proof that Membership Problem for Pedigree Polytopes, M3P ∈ P and P = NP via properties of Pedigree Polytopes.
Towards Implementable Quantum Divide and Conquer: A TSP Solver with Improved Exponential Base over Held-Karp
⚛️
Quantum Computing
Content type:
Academic
arxiv.org
·
2d
2 days ago
Actions for Towards Implementable Quantum Divide and Conquer: A TSP Solver with Improved Exponential Base over Held-Karp
Longest Consecutive Sequence
🗂️
Vector Indexes
leetcode.com
·
3d
3 days ago
·
DEV
Actions for Longest Consecutive Sequence
Fixed-Parameter Tractability of $t$-Uniform Hypergraphicality
📐
Mathematics
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for Fixed-Parameter Tractability of $t$-Uniform Hypergraphicality
Average-Case and Smoothed Near-Optimality for Color-Code Decoding
🗂️
Vector Indexes
Content type:
Academic
arxiv.org
·
19h
19 hours ago
Actions for Average-Case and Smoothed Near-Optimality for Color-Code Decoding
Answer Set Programming for Egg Extraction and More
📐
E-graphs
Content type:
Academic
arxiv.org
·
19h
19 hours ago
Actions for Answer Set Programming for Egg Extraction and More
Page 2 »
Log in to enable infinite scrolling
Keyboard Shortcuts
Navigation
Next / previous item
j
/
k
Open post
o
or
Enter
Preview post
v
Post Actions
Love post
a
Like post
l
Dislike post
d
Undo reaction
u
Save / unsave
s
Recommendations
Add interest / feed
Enter
Not interested
x
Go to
Home
g
h
Interests
g
i
Feeds
g
f
Likes
g
l
History
g
y
Changelog
g
c
Settings
g
s
Browse
g
b
Search
/
Pagination
Next page
n
Previous page
p
General
Show this help
?
Submit feedback
!
Close modal / unfocus
Esc
Press
?
anytime to show this help