Ogihara, Mitsunori

From MaRDI portal
Person:161383

Available identifiers

zbMath Open ogihara.mitsunoriMaRDI QIDQ161383

List of research outcomes

PublicationDate of PublicationType
In memoriam: Alan L. Selman (1941--2021)2023-07-26Paper
Synchronous Boolean finite dynamical systems on directed graphs over XOR functions2023-07-26Paper
Properties of probabilistic pushdown automata2022-12-09Paper
Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions2022-07-18Paper
Generalized Predecessor Existence Problems for Boolean Finite Dynamical Systems2020-05-26Paper
Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs2019-02-28Paper
Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs2017-09-28Paper
A hierarchical model of data locality2017-08-21Paper
Computational Complexity Studies of Synchronous Boolean Finite Dynamical Systems2015-09-30Paper
Time and space complexity for splicing systems2010-10-06Paper
On the autoreducibility of functions2010-05-10Paper
LATIN 2004: Theoretical Informatics2009-05-07Paper
Complexity Theory for Splicing Systems2007-11-28Paper
Complexity theory for splicing systems2007-10-25Paper
Very Sparse Leaf Languages2007-09-05Paper
Autoreducibility, mitoticity, and immunity2007-05-30Paper
Mathematical Foundations of Computer Science 20052006-10-20Paper
Mathematical Foundations of Computer Science 20052006-10-20Paper
The complexity of finding top-Toda-equivalence-class members2006-10-16Paper
The enumerability of P collapses P to NC2005-12-06Paper
Mathematical Foundations of Computer Science 20042005-08-22Paper
Competing provers yield improved Karp-Lipton collapse results2005-05-04Paper
On the reducibility of sets inside NP to sets with low information content2005-02-23Paper
https://portal.mardi4nfdi.de/entity/Q48235332004-10-28Paper
https://portal.mardi4nfdi.de/entity/Q44370822003-12-07Paper
The (Non)enumerability of the determinant and the rank2003-08-26Paper
A note on square rooting of time functions of Turing machines2003-08-26Paper
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.2003-08-17Paper
https://portal.mardi4nfdi.de/entity/Q44186792003-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44105192003-07-03Paper
https://portal.mardi4nfdi.de/entity/Q44105232003-07-03Paper
Tally NP sets and easy census functions.2003-01-14Paper
https://portal.mardi4nfdi.de/entity/Q47791752002-11-25Paper
https://portal.mardi4nfdi.de/entity/Q45363752002-11-04Paper
Reducing the number of solutions of NP functions2002-08-04Paper
https://portal.mardi4nfdi.de/entity/Q45308632002-06-09Paper
PlanMine: Prediction plan failures using sequence mining2002-05-02Paper
The complexity theory companion2001-02-19Paper
https://portal.mardi4nfdi.de/entity/Q45256842001-01-24Paper
The complexity of matrix rank and feasible systems of linear equations2000-12-05Paper
https://portal.mardi4nfdi.de/entity/Q42527202000-04-26Paper
https://portal.mardi4nfdi.de/entity/Q42636901999-11-21Paper
https://portal.mardi4nfdi.de/entity/Q42284571999-10-14Paper
https://portal.mardi4nfdi.de/entity/Q42599841999-09-08Paper
https://portal.mardi4nfdi.de/entity/Q42181221999-06-21Paper
https://portal.mardi4nfdi.de/entity/Q42284661999-05-18Paper
Properties of probabilistic pushdown automata1999-01-12Paper
The PL Hierarchy Collapses1998-09-21Paper
https://portal.mardi4nfdi.de/entity/Q38388331998-08-13Paper
Universally serializable computation1998-08-04Paper
Oracles That Compute Values1998-02-10Paper
https://portal.mardi4nfdi.de/entity/Q43594561997-10-08Paper
https://portal.mardi4nfdi.de/entity/Q43362731997-08-11Paper
On closure properties of \(\#\text{P}\) in the context of \(\text{PF} \circ \#\text{P}\)1997-03-31Paper
\(p\)-Selective sets and reducing search to decision vs. self-reducibility1997-03-31Paper
Reducibility classes of P-selective sets1997-02-27Paper
On helping by parity-like languages1997-02-27Paper
Functions computable with limited access to NP1997-02-27Paper
Relationships among $PL$, $\#L$, and the determinant1996-11-10Paper
Computing Solutions Uniquely Collapses the Polynomial Hierarchy1996-10-16Paper
Equivalence of NC\(^ k\) and AC\(^{k-1}\) closures of NP and other classes1996-09-15Paper
NONDETERMINISTICALLY SELECTIVE SETS1996-08-13Paper
ON SERIALIZABLE LANGUAGES1996-01-28Paper
Polynomial-Time Membership Comparable Sets1995-11-29Paper
Space-efficient recognition of sparse self-reducible languages1995-05-14Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Ogihara, Mitsunori