Timeline for Logarithmic space verifier with unbounded witness

Current License: CC BY-SA 4.0

Post Revisions

13 events

when toggle format	what		by	license	comment
May 23, 2020 at 8:37	comment	added	Avital Livshits		@D.W. I tried that at first but I'm really bad at LaTex and couldnt get it right..
May 23, 2020 at 8:35	history	edited	Avital Livshits	CC BY-SA 4.0	added 73 characters in body
May 23, 2020 at 8:31	vote	accept	Avital Livshits
May 23, 2020 at 3:26	comment	added	D.W.♦		Don't use images as main content of your post. This makes your question impossible to search and inaccessible to the visually impaired; we don't like that. Please transcribe text and mathematics (note that you can use LaTeX).
May 23, 2020 at 3:26	comment	added	D.W.♦		Please credit the source of all copied material and images. See cs.stackexchange.com/help/referencing.
May 22, 2020 at 20:06	answer	added	prime_hit		timeline score: 1
May 22, 2020 at 20:05	answer	added	Yuval Filmus		timeline score: 3
May 22, 2020 at 19:57	comment	added	Yuval Filmus		Right, sorry. The name $\mathcal{C}_2$ is not the best in these circumstances.
May 22, 2020 at 19:56	history	reopened	Yuval Filmus complexity-theory
May 22, 2020 at 18:56	comment	added	Avital Livshits		@YuvalFilmus You marked this as a duplicate of cs.stackexchange.com/questions/79356/mathsfnl-versus-mathsfnl2, but its not really the same question. The other question is about multiple reads of the witness tape, and my question is about a single read of the tape but with unbounded witness length.
May 22, 2020 at 18:33	history	closed	Yuval Filmus complexity-theory		Duplicate of $\mathsf{NL}$ versus $\mathsf{NL}[2]$
May 22, 2020 at 18:33	review	First posts
May 22, 2020 at 18:38
May 22, 2020 at 18:24	history	asked	Avital Livshits	CC BY-SA 4.0