Algorithms

Feeds to Scour
SubscribedAll
Scoured 230 posts in 8.3 ms

On the Complexity of Signed Domination

ย ๐Ÿ—‚๏ธData Structures ย Content type: Academic
arxiv.orgยท

Approximability limits for bounded-degree max-LINSAT and implications for decoded quantum interferometry

ย ๐Ÿ—‚๏ธData Structures ย Content type: Academic
arxiv.orgยท

A unified complexity bound for logconcave sampling

ย ๐Ÿ—‚๏ธData Structures ย Content type: Academic
arxiv.orgยท

Fast and perfect sampling of subgraphs and polymer systems

ย ๐Ÿ—‚๏ธData Structures ย Content type: Academic
arxiv.orgยท

A note on rounding fractional matchings with constant-factor strong negative correlation

ย ๐Ÿ—‚๏ธData Structures ย Content type: Academic
arxiv.orgยท

Online Learning with Recency: Algorithms for Sliding-window Streaming Multi-armed Bandits

ย ๐Ÿ—‚๏ธData Structures ย Content type: Academic
arxiv.orgยท

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

ย ๐Ÿ—‚๏ธData Structures ย Content type: Academic
arxiv.orgยท

Engineering Scalable Distributed List Ranking

ย ๐Ÿ—‚๏ธData Structures ย Content type: Academic
arxiv.orgยท

Proceedings of the 14th edition of the conference on Random Generation of Combinatorial Structures

ย ๐Ÿ—‚๏ธData Structures ย Content type: Academic
arxiv.orgยท

From Estimates to Schedules: Learning-Augmented Restricted Assignment

ย ๐Ÿ—‚๏ธData Structures ย Content type: Academic
arxiv.orgยท

Quotient Admission Algorithms for Witness-Supported Graph Windows

ย ๐Ÿ—‚๏ธData Structures ย Content type: Academic
arxiv.orgยท

Counting Hamiltonian Paths in 3-Regular Planar Graphs

ย ๐Ÿ—‚๏ธData Structures ย Content type: Academic
arxiv.orgยท

Differentially Private Range Subgraph Counting

ย ๐Ÿ—‚๏ธData Structures ย Content type: Academic
arxiv.orgยท

The price of incrementality in k-center clustering

ย ๐Ÿ—‚๏ธData Structures ย Content type: Academic
arxiv.orgยท

The Arithmetic Circuit Combinatorial Nullstellensatz is NP-hard

ย ๐Ÿ—‚๏ธData Structures ย Content type: Academic
arxiv.orgยท

Optimal Online Equitable Allocation with Indivisible Resources

ย ๐Ÿ—‚๏ธData Structures ย 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