Pith. sign in

Kulikov, Ivan Mihajlin, and Denil Sharipov

Tatiana Belova, Alexander Golovnev, Alexander S · DOI 10.1137/1.9781611977554.ch124

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

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

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 7

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