1.The Hilbert Function, Algebraic Extractors, and Recursive Fourier Sampling

作　　者：Zachary Remscrim ;Zachary Remscrim

出　　处：Electronic Colloquium on Computational Complexity. 2016 ;2016.

出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung

文章 ID：215686970

文章详细全文下载

2.AC0 Pseudorandomness of Natural Operations

作　　者：Zachary Remscrim ;Michael Sipser

出　　处：Electronic Colloquium on Computational Complexity. 2013 ;2013.

出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung

文章 ID：88774835

文章详细全文下载

3.The Limitations of Few Qubits: One-way and Two-way Quantum Finite Automata and the Group Word Problem

作　　者：Zachary Remscrim

出　　处：Electronic Colloquium on Computational Complexity. 2019 ;2019:1-48.

出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung

文章 ID：243029013

文章详细全文下载

4.The Power of a Single Qubit: Two-way Quantum/Classical Finite Automata and the Word Problem for Linear Groups

作　　者：Zachary Remscrim

出　　处：Electronic Colloquium on Computational Complexity. 2019 ;2019:1-50.

出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung

文章 ID：243029088

文章详细全文下载

5.The Limitations of Few Qubits: One-way and Two-way Quantum Finite Automata and the Group Word Problem

作　　者：Zachary Remscrim

出　　处：Electronic Colloquium on Computational Complexity. 2019 ;2019:1-48.

出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung

文章 ID：243731378

文章详细全文下载

6.The Power of a Single Qubit: Two-way Quantum/Classical Finite Automata and the Word Problem for Linear Groups

作　　者：Zachary Remscrim

出　　处：Electronic Colloquium on Computational Complexity. 2019 ;2019:1-50.

出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung

文章 ID：243731495

文章详细全文下载

7.The Power of a Single Qubit: Two-Way Quantum Finite Automata and the Word Problem

作　　者：Zachary Remscrim

出　　处：LIPIcs : Leibniz International Proceedings in Informatics. 2020 ;168:139:1-139:18.doi:10.4230/LIPIcs.ICALP.2020.139

出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik

文章 ID：255823174

文章详细全文下载

8.Lower Bounds on the Running Time of Two-Way Quantum Finite Automata and Sublogarithmic-Space Quantum Turing Machines

作　　者：Zachary Remscrim

出　　处：LIPIcs : Leibniz International Proceedings in Informatics. 2021 ;185:39:1-39:20.doi:10.4230/LIPIcs.ITCS.2021.39

出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik

文章 ID：259385509

文章详细全文下载

9.Eliminating Intermediate Measurements in Space-Bounded Quantum Computation

作　　者：Bill Fefferman ;Zachary Remscrim

出　　处：Electronic Colloquium on Computational Complexity. 2020 ;2020:1-31.

出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung

文章 ID：259794796

文章详细全文下载

全文

出版年度

作者

来源期刊

学科主题

语种

国别/地区

检索条件:"( ( 高级检索(( ((AU:(("Zachary Remscrim")))) )) ) )"

	Electronic Colloquium on Computational Complexity	7篇
	LIPIcs : Leibniz International Proceedings in Informatics	2篇

	Zachary Remscrim	9篇
	Bill Fefferman	1篇
	Michael Sipser	1篇