Title resolution pending

We now build a standard QFBAPA formulaδ= V B constraint(B)where: constraint(B) = |B|=k B ifk B <∞ 𝕂 |B| ≥limitifk B = +∞𝕂 wherelimitis the maximum number that is considered as infi

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

1 Pith paper citing it

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.

representative citing papers

Verifying Quantized GNNs With Readout Is Decidable But Highly Intractable

cs.LO · 2025-10-09 · unverdicted · novelty 6.0

Verification of quantized GNNs with readout is (co)NEXPTIME-complete.

citing papers explorer

Showing 1 of 1 citing paper.

Verifying Quantized GNNs With Readout Is Decidable But Highly Intractable cs.LO · 2025-10-09 · unverdicted · none · ref 6
Verification of quantized GNNs with readout is (co)NEXPTIME-complete.

Title resolution pending

fields

years

verdicts

representative citing papers

citing papers explorer