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: 2982
Articles: 2'033'387
Articles rated: 2577

26 January 2021
 
  » search

 Search for articles, messages and online reviews


Search in 2'033'387 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 21 to 40 of 40 for query "Tomoyuki Yamakami". (0.00 sec.)

Prev [    1    2    ]
21.
Counting list matrix partitions of graphs
Andreas Göbel; Leslie Ann Goldberg; Colin McQuillan; David Richerby; Tomoyuki Yamakami;
21 Jun 2013
- - -
22.
Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages
Tomoyuki Yamakami;
7 Mar 2013
- - -
23.
Constant Unary Constraints and Symmetric Real-Weighted Counting Constraint Satisfaction Problems
Tomoyuki Yamakami;
6 Mar 2013
- - -
24.
One-Way Reversible and Quantum Finite Automata with Advice
Tomoyuki Yamakami;
30 Aug 2012
- - -
25.
The Dissecting Power of Regular Languages
Tomoyuki Yamakami; Yuichi Kato;
22 Feb 2012
- - -
26.
Approximation Complexity of Complex-Weighted Degree-Two Counting Constraint Satisfaction Problems
Tomoyuki Yamakami;
27 Sep 2011
- - -
27.
Optimization, Randomized Approximability, and Boolean Constraint Satisfaction Problems
Tomoyuki Yamakami;
16 Sep 2011
- - -
28.
A Trichotomy Theorem for the Approximate Counting of Complex-Weighted Bounded-Degree Boolean CSPs
Tomoyuki Yamakami;
16 Aug 2010
- - -
29.
The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata
Tomoyuki Yamakami;
18 Jul 2010
- - -
30.
Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems
Tomoyuki Yamakami;
2 Jul 2010
- - -
31.
Pseudorandom Generators against CFL/n
Tomoyuki Yamakami;
16 Feb 2009
- - -
32.
Immunity and Pseudorandomness of Context-Free Languages
Tomoyuki Yamakami;
2 Feb 2009
- - -
33.
The Efficiency of Quantum Identity Testing of Multiple States
Masaru Kada; Harumichi Nishimura; Tomoyuki Yamakami;
11 Sep 2008
- - -
34.
Swapping Lemmas for Regular and Context-Free Languages with Advice
Tomoyuki Yamakami;
29 Aug 2008
- - -
35.
Quantum List Decoding from Quantumly Corrupted Codewords for Classical Block Codes of Polynomially Small Rate
Tomoyuki Yamakami;
23 Oct 2006
- - -
36.
Computational Indistinguishability between Quantum States and Its Cryptographic Application
Akinori Kawachi; Takeshi Koshiba; Harumichi Nishimura; Tomoyuki Yamakami;
Rating  5/5
9 Mar 2004
- - -
37.
An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation
Harumichi Nishimura; Tomoyuki Yamakami;
29 Nov 2003
- - -
38.
Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?
Hirotada Kobayashi; Keiji Matsumoto; Tomoyuki Yamakami;
6 Jun 2003
- - -
39.
Quantum DNF Learnability Revisited
Jeffrey C. Jackson; Christino Tamon; Tomoyuki Yamakami;
12 Feb 2002
- - -
40.
Quantum Certificate Verification: Single versus Multiple Quantum Certificates
Hirotada Kobayashi; Keiji Matsumoto; Tomoyuki Yamakami;
1 Oct 2001
- - -

Prev [ 1 2 ]





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