Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice

被引：0

作者：

Yamakami, Tomoyuki ^{[1
]}

机构：

[1] Faculty of Engineering, University of Fukui, 3-9-1 Bunkyo, Fukui,910-8507, Japan

来源：

Information and Computation | 2022年 / 286卷

关键词：

Compendex;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Finite automata

引用

共 50 条

[1] Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice
Yamakami, Tomoyuki
INFORMATION AND COMPUTATION, 2022, 286
[2] Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata
Yamakami, Tomoyuki
FUNDAMENTALS OF COMPUTATION THEORY, FCT 2023, 2023, 14292 : 421 - 435
[3] Unambiguity and Fewness for Nonuniform Families of Polynomial-Size Nondeterministic Finite Automata
Yamakami, Tomoyuki
REACHABILITY PROBLEMS, RP 2022, 2022, 13608 : 77 - 92
[4] Quantum Homomorphic Encryption for Polynomial-Size Circuits
Dulek, Yfke
Schaffner, Christian
Speelman, Florian
THEORY OF COMPUTING, 2018, 14
[5] AND and/or OR: Uniform Polynomial-Size Circuits
Murphy, Niall
Woods, Damien
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2013, (128): : 150 - 166
[6] On polynomial-size programs winning finite-state games
Lescow, H
COMPUTER AIDED VERIFICATION, 1995, 939 : 239 - 252
[7] POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS
Bern, Marshall
Eppstein, David
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1992, 2 (03) : 241 - 255
[8] ON SOLVING HARD PROBLEMS BY POLYNOMIAL-SIZE CIRCUITS
HUYNH, DT
INFORMATION PROCESSING LETTERS, 1987, 24 (03) : 171 - 176
[9] Embedding Stacked Polytopes on a Polynomial-Size Grid
Erik D. Demaine
André Schulz
Discrete & Computational Geometry, 2017, 57 : 782 - 809
[10] Embedding Stacked Polytopes on a Polynomial-Size Grid
Demaine, Erik D.
Schulz, Andre
PROCEEDINGS OF THE TWENTY-SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2011, : 1177 - 1187

← 1 2 3 4 5 →