◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

A. Smaill

1 paper here

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • last author1

Across the 1 of 1 paper where every author was matched, so the position is known.

fields
  • cs.AI1

identity via Semantic Scholar / OpenAlex

most citedBackbone Fragility and the Local Search Cost Peak

79 citations · 79 across the 1 of their papers we have counts for

collaborators

1 paper

cs.AI2011★ 79 cited

Backbone Fragility and the Local Search Cost Peak

I. P. Gent, J. Singer, A. Smaill

The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instance…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.