Tetsuro Nishino

From MaRDI portal
Person:671624

Available identifiers

zbMath Open nishino.tetsuroMaRDI QIDQ671624

List of research outcomes





PublicationDate of PublicationType
On the complexity of negation-limited Boolean networks (preliminary version)2016-09-01Paper
A CHARACTERIZATION OF k-TH POWERS Pn,k OF PATHS IN TERMS OF k-TREES2015-04-30Paper
A quantum algorithm using NMR computers to break secret-key cryptosystems2004-09-22Paper
Mathematical models of quantum computation2003-06-26Paper
https://portal.mardi4nfdi.de/entity/Q45509452002-11-11Paper
https://portal.mardi4nfdi.de/entity/Q45483162002-08-26Paper
On the computational power of bounded error quantum Turing machines2002-06-02Paper
Quantum computation and NP-complete problems2002-03-10Paper
A construction method for extended simple recurrent networks that simulate deterministic pushdown automata2001-09-17Paper
Quantum domains in copies of nonlinear quantum computations2001-09-17Paper
https://portal.mardi4nfdi.de/entity/Q45257262001-01-24Paper
https://portal.mardi4nfdi.de/entity/Q45053712000-09-27Paper
https://portal.mardi4nfdi.de/entity/Q49378712000-02-20Paper
https://portal.mardi4nfdi.de/entity/Q49372052000-02-03Paper
https://portal.mardi4nfdi.de/entity/Q49351402000-01-30Paper
https://portal.mardi4nfdi.de/entity/Q47055201999-12-20Paper
https://portal.mardi4nfdi.de/entity/Q47038741999-12-01Paper
https://portal.mardi4nfdi.de/entity/Q42662451999-09-28Paper
https://portal.mardi4nfdi.de/entity/Q42341081999-03-16Paper
On the Complexity of Negation-Limited Boolean Networks1998-09-20Paper
Negation-limited circuit complexity of symmetric functions1997-02-27Paper
Relating attribute grammars and lexical-functional grammars1992-10-04Paper

Research outcomes over time

This page was built for person: Tetsuro Nishino

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:671624&oldid=7595473"
Powered by MediaWiki