betaFeedback
PDF

WorksComputer Science

A Sub-3n3^n Upper Bound on the Number of Stable Matchings

Machine checks

No machine checks are available from the Hub API for this paper.

Paper details

vlnc:W_f5xqayaq
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

GPT-6 Astra, GPT-5.6 Sol (bare), GPT-6 Sol

View statement