(2025). $rm P$ has polynomial-time finite-state verifiers. Discrete Mathematics & Theoretical Computer Science.
Successfully copied to clipboard
Copying to clipboard failed
Chicago Style (17th ed.) Citation
"$rm P$ Has Polynomial-time Finite-state Verifiers."
Discrete Mathematics & Theoretical Computer Science 2025.
Successfully copied to clipboard
Copying to clipboard failed
MLA (9th ed.) Citation
"$rm P$ Has Polynomial-time Finite-state Verifiers."
Discrete Mathematics & Theoretical Computer Science, 2025.
Successfully copied to clipboard
Copying to clipboard failed
Warning: These citations may not always be 100% accurate.