Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs (Q2163394): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q113863147, #quickstatements; #temporary_batch_1711031506070 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2022.06.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4282974102 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q113863147 / rank | |||
Normal rank | |||
Latest revision as of 16:47, 21 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs |
scientific article |
Statements
Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs (English)
0 references
10 August 2022
0 references
succinct arguments
0 references
holographic interactive oracle proofs
0 references
verifiable computing
0 references
random oracle model
0 references
