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 条

[21] Polynomial-size Frege and resolution proofs of st-connectivity and Hex tautologies
Buss, Samuel R.
THEORETICAL COMPUTER SCIENCE, 2006, 357 (1-3) : 35 - 52
[22] A direct construction of polynomial-size OBDD proof of pigeon hole problem
Chen, Wei
Zhang, Wenhui
INFORMATION PROCESSING LETTERS, 2009, 109 (10) : 472 - 477
[23] Polynomial-Size Models to Minimize Total Completion Time in a Parallel Batching Environment
Druetto, Alessandro
Grosso, Andrea
IFAC PAPERSONLINE, 2022, 55 (10): : 2173 - 2178
[24] Some New Consequences of the Hypothesis That P Has Fixed Polynomial-Size Circuits
Ding, Ning
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION (TAMC 2015), 2015, 9076 : 75 - 86
[25] The quantifier complexity of polynomial-size iterated definitions in first-order logic
Buss, Samuel R.
Johnson, Alan S.
MATHEMATICAL LOGIC QUARTERLY, 2010, 56 (06) : 573 - 590
[26] A NOTE ON POLYNOMIAL-SIZE CIRCUITS WITH LOW RESOURCE-BOUNDED KOLMOGOROV COMPLEXITY
HERMO, M
MAYORDOMO, E
MATHEMATICAL SYSTEMS THEORY, 1994, 27 (04): : 347 - 356
[27] Polynomial time quantum computation with advice
Nishimura, H
Yamakami, T
INFORMATION PROCESSING LETTERS, 2004, 90 (04) : 195 - 204
[28] A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs
Del Pia, Alberto
Khajavirad, Aida
MATHEMATICAL PROGRAMMING, 2024, 207 (1-2) : 269 - 301
[29] POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS (vol 2, pg 241, 1992)
Bern, M.
Eppstein, D.
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1992, 2 (04) : 449 - 450
[30] Distinguishing SAT from Polynomial-Size Circuits, through Black-Box Queries
Atserias, Albert
CCC 2006: TWENTY-FIRST ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2006, : 88 - 95

← 1 2 3 4 5 →