Pith. sign in

Title resolution pending

Omkar Baraskar, Agrim Dewan, Chandan Saha, Pulkit Sinha · 2024 · DOI 10.4230/lipics.icalp.2024.16

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
open at publisher browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.CC 1

years

2024 1

verdicts

CONDITIONAL 1

representative citing papers

The Complexity of Order-Finding for ROABPs

cs.CC · 2024-11-28 · conditional · novelty 7.0

Order-finding for ROABPs is NP-hard in the worst case, but efficient for generic and random instances, with approximation hardness transferring from cutwidth.

citing papers explorer

Showing 1 of 1 citing paper.

  • The Complexity of Order-Finding for ROABPs cs.CC · 2024-11-28 · conditional · none · ref 6

    Order-finding for ROABPs is NP-hard in the worst case, but efficient for generic and random instances, with approximation hardness transferring from cutwidth.