Complexity Theory

Feeds to Scour
SubscribedAll
Scoured 50 posts in 6.3 ms

Towards Implementable Quantum Divide and Conquer: A TSP Solver with Improved Exponential Base over Held-Karp

 📐Algorithms  Content type: Academic
arxiv.org·

Polynomial-time satisfiability for a special case of Positive$\wedge$Negative

 📐Algorithms  Content type: Academic
arxiv.org·

Fixed-Parameter Tractability of $t$-Uniform Hypergraphicality

 📐Algorithms  Content type: Academic
arxiv.org·

Bit-counting complexity classes

 📐Algorithms  Content type: Academic
arxiv.org·

Efficient Minimal Solvers for Visual-Inertial Relative Pose Estimation in Multi-Camera Systems

 📐Algorithms  Content type: Academic
arxiv.org·

DBHN-Net: Dual-Branch Hybrid Neural Network For Low-Complexity Monaural Speech Enhancement

 📐Algorithms  Content type: Academic
arxiv.org·

The Arithmetic Circuit Combinatorial Nullstellensatz is NP-hard

 📐Algorithms  Content type: Academic
arxiv.org·

Multilevel Stochastic Gradient Descent for Risk-Averse PDE-Constrained Optimization

 📐Algorithms  Content type: Academic
arxiv.org·

ATT-CR: Adaptive Triangular Transformer for Cloud Removal

 📐Algorithms  Content type: Academic
arxiv.org·

Fast Bounded-Independence Functions and Their Duals

 📊Information Theory  Content type: Academic
arxiv.org·

Complexity and Algorithms for Unary Translocation Distance

 📐Algorithms  Content type: Academic
arxiv.org·

Randomization for Faster Exact Optimization of Discounted Markov Decision Processes

 🎯Randomized Algorithms  Content type: Academic
arxiv.org·

A space-time sparse-grid method for the wave equation

 📐Algorithms  Content type: Academic
arxiv.org·

Validation of graph databases against PG-Schema

 🗄️Database Theory  Content type: Academic
arxiv.org·

Local Search on Vertex Coloring for Bipartite Graphs

 🕸️Graph Theory  Content type: Academic
arxiv.org·

Hybrid Metaheuristic Combining the Dragonfly Algorithm and Tabu Search for the Traveling Salesman Problem

 📐Algorithms  Content type: Academic
arxiv.org·

Token Rankings are Unforgeable Language Model Signatures

 📐Algorithms  Content type: Academic
arxiv.org·

Odd Cycle Transversal in $P_k$-Free Graphs

 🕸️Graph Theory  Content type: Academic
arxiv.org·

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption

 📐Algorithms  Content type: Academic
arxiv.org·

Mean Teacher based SSL Framework for Indoor Localization Using Wi-Fi RSSI Fingerprinting

 📐Algorithms  Content type: Academic
arxiv.org·

Keyboard Shortcuts

Navigation

Next / previous item
j/k
Open post
oorEnter
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
gh
Interests
gi
Feeds
gf
Likes
gl
History
gy
Changelog
gc
Settings
gs
Browse
gb
Search
/

General

Show this help
?
Submit feedback
!
Close modal / unfocus
Esc

Press ? anytime to show this help