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
Computational Complexity
⏱️ Computational Complexity
P vs NP, NP-Complete, Time Complexity, Reducibility
Filter Results
Timeframe
Fresh
Past Hour
Today
This Week
This Month
Feeds to Scour
Subscribed
All
Scoured
62
posts in
15.6
ms
Polynomial-time
satisfiability for a special case of Positive$\wedge$Negative
🎯
Complexity Classes
Content type:
Academic
arxiv.org
·
5d
5 days ago
Actions for Polynomial-time satisfiability for a special case of Positive$\wedge$Negative
A Proof on the
Computational
Complexity
of the Traveling Salesman Problem: Why P ≠
NP
🎯
Complexity Classes
zenodo.org
·
21h
21 hours ago
·
Hacker News
Actions for A Proof on the Computational Complexity of the Traveling Salesman Problem: Why P ≠ NP
Show HN:
TuringLLM
– a LLM-powered Universal Turing
machine
💻
CS
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
💻
CS
Content type:
Academic
nature.com
·
5d
5 days ago
·
Hacker News
Actions for Turing universal neural networks do not require global clocks
Towards Implementable Quantum Divide and Conquer: A TSP Solver with Improved Exponential Base over Held-Karp
🎯
Complexity Classes
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
The Arithmetic Circuit Combinatorial Nullstellensatz is
NP-hard
🎯
Complexity Classes
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for The Arithmetic Circuit Combinatorial Nullstellensatz is NP-hard
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.
🧮
Lean4
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.
Fixed-Parameter Tractability of $t$-Uniform Hypergraphicality
🎯
Complexity Classes
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for Fixed-Parameter Tractability of $t$-Uniform Hypergraphicality
Odd Cycle Transversal in $P_k$-Free Graphs
🎯
Complexity Classes
Content type:
Academic
arxiv.org
·
2d
2 days ago
Actions for Odd Cycle Transversal in $P_k$-Free Graphs
Efficient Minimal Solvers for Visual-Inertial Relative Pose Estimation in Multi-Camera Systems
💻
CS
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for Efficient Minimal Solvers for Visual-Inertial Relative Pose Estimation in Multi-Camera Systems
Randomized separations in black-box TFNP
🎯
Complexity Classes
Content type:
Academic
arxiv.org
·
6d
6 days ago
Actions for Randomized separations in black-box TFNP
Probabilistically Checking Quantum Proofs, with Interaction
💻
CS
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for Probabilistically Checking Quantum Proofs, with Interaction
Multilevel Stochastic Gradient Descent for Risk-Averse PDE-Constrained Optimization
💻
CS
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for Multilevel Stochastic Gradient Descent for Risk-Averse PDE-Constrained Optimization
Quantum
Time
Lower Bounds by Permutation Invariance
🎯
Complexity Classes
Content type:
Academic
arxiv.org
·
6d
6 days ago
Actions for Quantum Time Lower Bounds by Permutation Invariance
Complexity
and Algorithms for Unary Translocation Distance
🎯
Complexity Classes
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for Complexity and Algorithms for Unary Translocation Distance
Temporal matching in trees
🎯
Complexity Classes
Content type:
Academic
arxiv.org
·
5d
5 days ago
Actions for Temporal matching in trees
A
space-time
sparse-grid method for the wave equation
💻
CS
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for A space-time sparse-grid method for the wave equation
DBHN-Net: Dual-Branch Hybrid Neural Network For
Low-Complexity
Monaural Speech Enhancement
💻
CS
Content type:
Academic
arxiv.org
·
5d
5 days ago
Actions for DBHN-Net: Dual-Branch Hybrid Neural Network For Low-Complexity Monaural Speech Enhancement
Bit-counting
complexity
classes
💻
CS
Content type:
Academic
arxiv.org
·
6d
6 days ago
Actions for Bit-counting complexity classes
ATT-CR: Adaptive Triangular Transformer for Cloud Removal
💻
CS
Content type:
Academic
arxiv.org
·
5d
5 days ago
Actions for ATT-CR: Adaptive Triangular Transformer for Cloud Removal
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