Science-advisor
REGISTER info/FAQ
Login
username
password
     
forgot password?
register here
 
Research articles
  search articles
  reviews guidelines
  reviews
  articles index
My Pages
my alerts
  my messages
  my reviews
  my favorites
 
 
Stat
Members: 2980
Articles: 2'031'962
Articles rated: 2577

21 January 2021
 
  » search

 Search for articles, messages and online reviews


Search in 2'031'962 articles.
match all words (default)
match at least one of the words
match the exact phrase		 search in all fields
search in authors
search in journals

Results 1 to 20 of 40 for query "Tomoyuki Yamakami". (0.00 sec.)

[    1    2    ]   Next
1.
Quantum Computation Relative to Oracles
Christino Tamon; Tomoyuki Yamakami;
2 Oct 2000   /  Proceedings of the UMC 2000 Conference
- - -
2.
Quantum Minimal One Way Information: Relative Hardness and Quantum Advantage of Combinatorial Tasks
Harumichi Nishimura; Tomoyuki Yamakami;
28 Jul 2005
- - -
3.
An Application of Quantum Finite Automata to Interactive Proof Systems
Harumichi Nishimura; Tomoyuki Yamakami;
5 Oct 2004
- - -
4.
Resource Bounded Immunity and Simplicity
Tomoyuki Yamakami; Toshio Suzuki;
6 Jul 2004
- - -
5.
Quantum NP and a Quantum Hierarchy
Tomoyuki Yamakami;
23 Aug 2003
- - -
6.
Computational Complexity Measures of Multipartite Quantum Entanglement
Tomoyuki Yamakami;
13 Aug 2003   /  Proc. 14th ISAAC. Springer's LNCS, Vol.2906, pp.117-128, 2003
- - -
7.
Theory of One Tape Linear Time Turing Machines
Kohtaro Tadaki; Tomoyuki Yamakami; Jack C.H. Lin;
23 Oct 2003
- - -
8.
Analysis of Quantum Functions
Tomoyuki Yamakami;
2 Sep 1999   /  International Journal of Foundations of Computer Science, Vol.14(5), pp.815-852, October 2003.
- - -
9.
A Foundation of Programming a Multi-Tape Quantum Turing machine
Tomoyuki Yamakami;
23 Jun 1999
- - -
10.
NQP_{C} = co-C_{=}P
Tomoyuki Yamakami; Andrew C. Yao;
14 Dec 1998   /  Inform.Proc.Lett. 71 (1999) 63-69
- - -
11.
Constant-Space Quantum Interactive Proofs Against Multiple Provers
Tomoyuki Yamakami;
2 Sep 2013
- - -
12.
Synchronizing Deterministic Push-Down Automata Can Be Really Hard
Henning Fernau; Petra Wolf; Tomoyuki Yamakami;
4 May 2020
- - -
13.
How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory?
Tomoyuki Yamakami;
15 Jan 2020
- - -
14.
Nonuniform Families of Polynomial-Size Quantum Finite Automata and Quantum Logarithmic-Space Computation with Polynomial-Size Advice
Tomoyuki Yamakami;
5 Jul 2019
- - -
15.
One-Way Topological Automata and the Tantalizing Effects of Their Topological Features
Tomoyuki Yamakami;
18 Mar 2019
- - -
16.
Supportive Oracles for Parameterized Polynomial-Time Sub-Linear-Space Computations in Relation to L, NL, and P
Tomoyuki Yamakami;
17 Jan 2019
- - -
17.
State Complexity Characterizations of Parameterized Degree-Bounded Graph Connectivity, Sub-Linear Space Computation, and the Linear Space Hypothesis
Tomoyuki Yamakami;
15 Nov 2018
- - -
18.
The World of Combinatorial Fuzzy Problems and the Efficiency of Fuzzy Approximation Algorithms
Tomoyuki Yamakami;
10 Sep 2015
- - -
19.
Structural Complexity of Multi-Valued Partial Functions Computed by Nondeterministic Pushdown Automata
Tomoyuki Yamakami;
24 Aug 2015
- - -
20.
A Non-Interactive Quantum Bit Commitment Scheme that Exploits the Computational Hardness of Quantum State Distinction
Tomoyuki Yamakami;
2 Sep 2013
- - -

[ 1 2 ]   Next





ScienXe.org
» my Online CV
» Free


News, job offers and information for researchers and scientists:
home  |  contact  |  terms of use  |  sitemap
Copyright © 2005-2021 - Scimetrica