 | 2009 |
|---|
| 54 |       | Tomoyuki Yamakami:
Immunity and Pseudorandomness of Context-Free Languages
CoRR abs/0902.0261: (2009) |
| 53 | | Tomoyuki Yamakami:
Pseudorandom Generators against CFL/n
CoRR abs/0902.2774: (2009) |
| 52 | | Harumichi Nishimura,
Tomoyuki Yamakami:
An application of quantum finite automata to interactive proof systems.
J. Comput. Syst. Sci. 75(4): 255-269 (2009) |
| 2008 |
|---|
| 51 | | Tomoyuki Yamakami:
Swapping Lemmas for Regular and Context-Free Languages with Advice
CoRR abs/0808.4122: (2008) |
| 2007 |
|---|
| 50 | | Tomoyuki Yamakami:
Quantum List Decoding from Quantumly Corrupted Codewords for Classical Block Codes of Polynomially Small Rate.
CATS 2007: 153-162 |
| 2006 |
|---|
| 49 | | Akinori Kawachi,
Tomoyuki Yamakami:
Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding.
ICALP (2) 2006: 216-227 |
| 48 | | Akinori Kawachi,
Tomoyuki Yamakami:
Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding
CoRR abs/quant-ph/0602088: (2006) |
| 47 | | Akinori Kawachi,
Tomoyuki Yamakami:
Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding.
Electronic Colloquium on Computational Complexity (ECCC) 13(020): (2006) |
| 2005 |
|---|
| 46 | | Akinori Kawachi,
Takeshi Koshiba,
Harumichi Nishimura,
Tomoyuki Yamakami:
Computational Indistinguishability Between Quantum States and Its Cryptographic Application.
EUROCRYPT 2005: 268-284 |
| 45 | | Tomoyuki Yamakami:
Collapsing Recursive Oracles for Relativized Polynomial Hierarchies.
FCT 2005: 149-160 |
| 44 | | Harumichi Nishimura,
Tomoyuki Yamakami:
Quantum Minimal One Way Information: Relative Hardness and Quantum Advantage of Combinatorial Tasks
CoRR abs/quant-ph/0507270: (2005) |
| 43 | | Tomoyuki Yamakami,
Toshio Suzuki:
Resource bounded immunity and simplicity.
Theor. Comput. Sci. 347(1-2): 90-129 (2005) |
| 2004 |
|---|
| 42 | | Harumichi Nishimura,
Tomoyuki Yamakami:
An Application of Quantum Finite Automata to Interactive Proof Systems.
CIAA 2004: 225-236 |
| 41 |  | Toshio Suzuki,
Tomoyuki Yamakami:
Resource Bounded Immunity and Simplicity.
IFIP TCS 2004: 81-96 |
| 40 | | Harumichi Nishimura,
Tomoyuki Yamakami:
An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation (Extended Abstract).
MFCS 2004: 827-838 |
| 39 | | Kohtaro Tadaki,
Tomoyuki Yamakami,
Jack C. H. Lin:
Theory of One Tape Linear Time Turing Machines.
SOFSEM 2004: 335-348 |
| 38 | | Tomoyuki Yamakami,
Toshio Suzuki:
Resource Bounded Immunity and Simplicity
CoRR cs.CC/0407015: (2004) |
| 37 | | Harumichi Nishimura,
Tomoyuki Yamakami:
An Application of Quantum Finite Automata to Interactive Proof Systems
CoRR quant-ph/0410040: (2004) |
| 36 | | Tomoyuki Yamakami,
Toshio Suzuki:
Resource Bounded Immunity and Simplicity
Electronic Colloquium on Computational Complexity (ECCC)(066): (2004) |
| 35 | | Tomoyuki Yamakami,
Harumichi Nishimura:
An Application of Quantum Finite Automata to Interactive Proof Systems
Electronic Colloquium on Computational Complexity (ECCC)(110): (2004) |
| 34 | | Harumichi Nishimura,
Tomoyuki Yamakami:
Polynomial time quantum computation with advice.
Inf. Process. Lett. 90(4): 195-204 (2004) |
| 2003 |
|---|
| 33 | | Tomoyuki Yamakami:
Nearly Bounded Error Probabilistic Sets.
CIAC 2003: 213-226 |
| 32 | | Tomoyuki Yamakami:
Computational Complexity Measures of Multipartite Quantum Entanglement.
ISAAC 2003: 117-128 |
| 31 | | Hirotada Kobayashi,
Keiji Matsumoto,
Tomoyuki Yamakami:
Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?
ISAAC 2003: 189-198 |
| 30 | | Kohtaro Tadaki,
Tomoyuki Yamakami,
Jack C. H. Lin:
Theory of One Tape Linear Time Turing Machines
CoRR cs.CC/0310046: (2003) |
| 29 | | Harumichi Nishimura,
Tomoyuki Yamakami:
Polynomial time quantum computation with advice
CoRR quant-ph/0305100: (2003) |
| 28 | | Tomoyuki Yamakami:
Computational Complexity Measures of Multipartite Quantum Entanglement
CoRR quant-ph/0308072: (2003) |
| 27 | | Harumichi Nishimura,
Tomoyuki Yamakami:
An Algorithmic Argument for Query Complexity Lower Bounds of Advised Quantum Computation
CoRR quant-ph/0312003: (2003) |
| 26 | | Harumichi Nishimura,
Tomoyuki Yamakami:
Polynomial time quantum computation with advice
Electronic Colloquium on Computational Complexity (ECCC)(059): (2003) |
| 25 | | Tomoyuki Yamakami:
Analysis Of Quantum Functions.
Int. J. Found. Comput. Sci. 14(5): 815-852 (2003) |
| 2002 |
|---|
| 24 | | Jeffrey C. Jackson,
Christino Tamon,
Tomoyuki Yamakami:
Quantum DNF Learnability Revisited.
COCOON 2002: 595-604 |
| 23 | | Tomoyuki Yamakami:
Quantum NP and Quantum Hierarchy.
IFIP TCS 2002: 323-336 |
| 22 | | Tomoyuki Yamakami:
Quantum Optimization Problems.
UMC 2002: 300-314 |
| 2001 |
|---|
| 21 | | Hirotada Kobayashi,
Keiji Matsumoto,
Tomoyuki Yamakami:
Quantum Certificate Verification: Single versus Multiple Quantum Certificates
CoRR quant-ph/0110006: (2001) |
| 2000 |
|---|
| 20 | | Christino Tamon,
Tomoyuki Yamakami:
Quantum Computation Relative to Oracles.
UMC 2000: 273-288 |
| 1999 |
|---|
| 19 | | Tomoyuki Yamakami:
Analysis of Quantum Functions (Preliminary Version).
FSTTCS 1999: 407-419 |
| 18 | | Tomoyuki Yamakami:
A Foundation of Programming a Multi-tape Quantum Turing Machine.
MFCS 1999: 430-441 |
| 17 | | Tomoyuki Yamakami:
A Foundation of Programming a Multi-Tape Quantum Turing machine
CoRR quant-ph/9906084: (1999) |
| 16 | | Tomoyuki Yamakami:
Analysis of Quantum Functions
CoRR quant-ph/9909012: (1999) |
| 15 | | Tomoyuki Yamakami,
Andrew Chi-Chih Yao:
NQPC = co-C=P.
Inf. Process. Lett. 71(2): 63-69 (1999) |
| 14 | | Tomoyuki Yamakami:
Polynomial Time Samplable Distributions.
J. Complexity 15(4): 557-574 (1999) |
| 1998 |
|---|
| 13 | | Tomoyuki Yamakami,
Andrew Chi-Chih Yao:
NQPC = co-C=P
CoRR quant-ph/9812032: (1998) |
| 12 | | Tomoyuki Yamakami,
Andrew Chi-Chih Yao:
NQP = co-C=P
Electronic Colloquium on Computational Complexity (ECCC) 5(73): (1998) |
| 1997 |
|---|
| 11 | | Stephen A. Cook,
Russell Impagliazzo,
Tomoyuki Yamakami:
A Tight Relationship Between Generic Oracles and Type-2 Complexity Theory.
Inf. Comput. 137(2): 159-170 (1997) |
| 1996 |
|---|
| 10 | | Tomoyuki Yamakami:
Polynomial Time Samplable Distributions.
MFCS 1996: 566-578 |
| 9 | | Tomoyuki Yamakami:
Polynomial Games and Determinacy.
Ann. Pure Appl. Logic 80(1): 1-16 (1996) |
| 8 | | Lance Fortnow,
Tomoyuki Yamakami:
Generic Separations.
J. Comput. Syst. Sci. 52(1): 191-197 (1996) |
| 7 | | Rainer Schuler,
Tomoyuki Yamakami:
Structural Average Case Complexity.
J. Comput. Syst. Sci. 52(2): 308-348 (1996) |
| 1995 |
|---|
| 6 | | Rainer Schuler,
Tomoyuki Yamakami:
Sets Computable in Polynomial Time on Average.
COCOON 1995: 400-409 |
| 5 | | Tomoyuki Yamakami:
Polynomial Time Samplable Distributions
Electronic Colloquium on Computational Complexity (ECCC) 2(39): (1995) |
| 4 | | Tomoyuki Yamakami:
Feasible Computability and Resource Bounded Topology
Inf. Comput. 116(2): 214-230 (1995) |
| 1994 |
|---|
| 3 | | Lance Fortnow,
Tomoyuki Yamakami:
Generic Separations.
Structure in Complexity Theory Conference 1994: 139-145 |
| 1992 |
|---|
| 2 | | Rainer Schuler,
Tomoyuki Yamakami:
Structural Average Case Complexity.
FSTTCS 1992: 128-139 |
| 1 | | Tomoyuki Yamakami:
Structural Properties for Feasibly Computable Classes of Type Two.
Mathematical Systems Theory 25(3): 177-201 (1992) |
