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
62
posts in
7.7
ms
On the
Complexity
of Signed Domination
🔗
WCOJ
Content type:
Academic
arxiv.org
·
15h
15 hours ago
Actions for On the Complexity of Signed Domination
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 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
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
Average-Case and Smoothed Near-Optimality for Color-Code Decoding
🗂️
Vector Indexes
Content type:
Academic
arxiv.org
·
15h
15 hours ago
Actions for Average-Case and Smoothed Near-Optimality for Color-Code Decoding
Temporal matching in trees
🔗
Combinatorics
Content type:
Academic
arxiv.org
·
5d
5 days ago
Actions for Temporal matching in trees
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
Odd Cycle Transversal in $P_k$-Free Graphs
🔗
Combinatorics
Content type:
Academic
arxiv.org
·
2d
2 days ago
Actions for Odd Cycle Transversal in $P_k$-Free Graphs
Bit-counting
complexity
classes
🔗
Combinatorics
Content type:
Academic
arxiv.org
·
6d
6 days ago
Actions for Bit-counting complexity classes
Probabilistically Checking Quantum Proofs, with Interaction
📐
Mathematics
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for Probabilistically Checking Quantum Proofs, with Interaction
Validation of graph databases against PG-Schema
🔗
WCOJ
Content type:
Academic
arxiv.org
·
5d
5 days ago
Actions for Validation of graph databases against PG-Schema
Efficiently Restructuring Sovereign Debt via Arctic Auctions with Convex Costs
🔗
WCOJ
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for Efficiently Restructuring Sovereign Debt via Arctic Auctions with Convex Costs
Efficient Minimal Solvers for Visual-Inertial Relative Pose Estimation in Multi-Camera Systems
🔍
Vector Search Algorithms
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for Efficient Minimal Solvers for Visual-Inertial Relative Pose Estimation in Multi-Camera Systems
Non-obvious Manipulability in the Additively Separable Group Activity Selection
Problem
🧮
Constraint Solvers
Content type:
Academic
arxiv.org
·
6d
6 days ago
Actions for Non-obvious Manipulability in the Additively Separable Group Activity Selection Problem
N-Player Binary Games with Unidirectional Dependencies: Cycle Robustness and Induced Indifference
🔄
Eventual Consistency
Content type:
Academic
arxiv.org
·
2d
2 days ago
Actions for N-Player Binary Games with Unidirectional Dependencies: Cycle Robustness and Induced Indifference
Constant Approximation for Hylland--Zeckhauser Equilibria
🔄
Eventual Consistency
Content type:
Academic
arxiv.org
·
5d
5 days ago
Actions for Constant Approximation for Hylland--Zeckhauser Equilibria
Discovering Data Structures: Nearest Neighbor Search and Beyond
📌
Embedding Retrieval
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for Discovering Data Structures: Nearest Neighbor Search and Beyond
Complexity
and
Algorithms
for Unary Translocation Distance
🔍
Vector Search Algorithms
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for Complexity and Algorithms for Unary Translocation Distance
DBHN-Net: Dual-Branch Hybrid Neural Network For
Low-Complexity
Monaural Speech Enhancement
〰️
Signal Processing
Content type:
Academic
arxiv.org
·
5d
5 days ago
Actions for DBHN-Net: Dual-Branch Hybrid Neural Network For Low-Complexity Monaural Speech Enhancement
Menu Selection: A
Computational
Approach to Minimizing Food Waste
💰
Cost-Based Optimization
Content type:
Academic
arxiv.org
·
2d
2 days ago
Actions for Menu Selection: A Computational Approach to Minimizing Food Waste
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