The following pages link to Tomoyuki Yamakami (Q434348):
Displayed 50 items.
- Computational indistinguishability between quantum states and its cryptographic application (Q434349) (← links)
- A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs (Q443724) (← links)
- One-way reversible and quantum finite automata with advice (Q476173) (← links)
- Immunity and pseudorandomness of context-free languages (Q653340) (← links)
- Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems (Q690466) (← links)
- Approximate counting for complex-weighted Boolean constraint satisfaction problems (Q690490) (← links)
- Intersection and union hierarchies of deterministic context-free languages and pumping lemmas (Q782591) (← links)
- Pseudorandom generators against advised context-free languages (Q899305) (← links)
- An application of quantum finite automata to interactive proof systems (Q1015813) (← links)
- Theory of one-tape linear-time Turing machines (Q1041220) (← links)
- A tight relationship between generic oracles and type-2 complexity theory (Q1369098) (← links)
- Polynomial time samplable distributions (Q1578504) (← links)
- \(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\) (Q1606968) (← links)
- Parameterized graph connectivity and polynomial-time sub-linear-space short reductions (preliminary report) (Q1685795) (← links)
- Feasible computability and resource bounded topology (Q1891148) (← links)
- Generic separations (Q1915515) (← links)
- Structural average case complexity (Q1916530) (← links)
- Polynomial games and determinacy (Q1919550) (← links)
- The dissecting power of regular languages (Q1943627) (← links)
- Synchronizing words for real-time deterministic pushdown automata (extended abstract) (Q2079977) (← links)
- Quantum logical depth and shallowness of streaming data by one-way quantum finite-state transducers (preliminary report) (Q2152096) (← links)
- Kolmogorov complexity descriptions of the exquisite behaviors of advised deterministic pushdown automata (Q2164011) (← links)
- Behavioral strengths and weaknesses of various models of limited automata (Q2206256) (← links)
- Constant-space quantum interactive proofs against multiple provers (Q2252642) (← links)
- Constant unary constraints and symmetric real-weighted counting constraint satisfaction problems (Q2254494) (← links)
- Relativizations of nonuniform quantum finite automata families (Q2326825) (← links)
- Supportive oracles for parameterized polynomial-time sub-linear-space computations in relation to L, NL, and P (Q2327512) (← links)
- Polynomial time quantum computation with advice (Q2390250) (← links)
- One-way bounded-error probabilistic pushdown automata and Kolmogorov complexity (preliminary report) (Q2408814) (← links)
- Interactive proofs with quantum finite automata (Q2513604) (← links)
- Resource bounded immunity and simplicity (Q2576870) (← links)
- Between SC and LOGDCFL: families of languages accepted by polynomial-time logarithmic-space deterministic auxiliary depth-\(k\) storage automata (Q2695283) (← links)
- (Q2707540) (← links)
- Uniform-Circuit and Logarithmic-Space Approximations of Refined Combinatorial Optimization Problems (Q2867130) (← links)
- Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages (Q2938126) (← links)
- Counting List Matrix Partitions of Graphs (Q2944567) (← links)
- A Trichotomy Theorem for the Approximate Counting of Complex-Weighted Bounded-Degree Boolean CSPs (Q3066165) (← links)
- THE ROLES OF ADVICE TO ONE-TAPE LINEAR-TIME TURING MACHINES AND FINITE AUTOMATA (Q3069734) (← links)
- Approximation Complexity of Complex-Weighted Degree-Two Counting Constraint Satisfaction Problems (Q3087944) (← links)
- Optimization, Randomized Approximability, and Boolean Constraint Satisfaction Problems (Q3104640) (← links)
- Not All Multi-Valued Partial CFL Functions Are Refined by Single-Valued Functions (Extended Abstract) (Q3190157) (← links)
- Complexity Bounds of Constant-Space Quantum Computation (Q3451121) (← links)
- The efficiency of quantum identity testing of multiple states (Q3531190) (← links)
- Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding (Q3591441) (← links)
- The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata (Extended Abstract) (Q3652280) (← links)
- Structural properties for feasibly computable classes of type two (Q4009811) (← links)
- (Q4025000) (← links)
- (Q4375820) (← links)
- (Q4437109) (← links)
- (Q4437510) (← links)