The following pages link to Ogihara, Mitsunori (Q161383):
Displayed 50 items.
- (Q218077) (redirect page) (← links)
- Reducibility classes of P-selective sets (Q672155) (← links)
- Autoreducibility, mitoticity, and immunity (Q881593) (← links)
- On the autoreducibility of functions (Q970103) (← links)
- Properties of probabilistic pushdown automata (Q1274989) (← links)
- Space-efficient recognition of sparse self-reducible languages (Q1337147) (← links)
- On helping by parity-like languages (Q1349740) (← links)
- Functions computable with limited access to NP (Q1351162) (← links)
- Universally serializable computation (Q1384538) (← links)
- The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. (Q1401394) (← links)
- The (Non)enumerability of the determinant and the rank (Q1405783) (← links)
- A note on square rooting of time functions of Turing machines (Q1405791) (← links)
- Reducing the number of solutions of NP functions (Q1608321) (← links)
- Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs (Q1729688) (← links)
- On the reducibility of sets inside NP to sets with low information content (Q1765294) (← links)
- Competing provers yield improved Karp-Lipton collapse results (Q1775885) (← links)
- On closure properties of \(\#\text{P}\) in the context of \(\text{PF} \circ \#\text{P}\) (Q1816726) (← links)
- \(p\)-Selective sets and reducing search to decision vs. self-reducibility (Q1816728) (← links)
- Tally NP sets and easy census functions. (Q1854340) (← links)
- Equivalence of NC\(^ k\) and AC\(^{k-1}\) closures of NP and other classes (Q1898478) (← links)
- Time and space complexity for splicing systems (Q1959375) (← links)
- The complexity of matrix rank and feasible systems of linear equations (Q1961056) (← links)
- Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs (Q2407103) (← links)
- Complexity theory for splicing systems (Q2455600) (← links)
- The complexity of finding top-Toda-equivalence-class members (Q2509036) (← links)
- The enumerability of P collapses P to NC (Q2575747) (← links)
- Computational Complexity Studies of Synchronous Boolean Finite Dynamical Systems (Q2948456) (← links)
- (Q3838833) (← links)
- The PL Hierarchy Collapses (Q4210116) (← links)
- (Q4218122) (← links)
- (Q4228457) (← links)
- (Q4228466) (← links)
- (Q4252720) (← links)
- (Q4259984) (← links)
- (Q4263690) (← links)
- (Q4336273) (← links)
- (Q4359456) (← links)
- Oracles That Compute Values (Q4376168) (← links)
- (Q4410519) (← links)
- (Q4410523) (← links)
- (Q4418679) (← links)
- (Q4437082) (← links)
- (Q4525684) (← links)
- (Q4530863) (← links)
- (Q4536375) (← links)
- (Q4779175) (← links)
- (Q4823533) (← links)
- ON SERIALIZABLE LANGUAGES (Q4853330) (← links)
- Polynomial-Time Membership Comparable Sets (Q4857595) (← links)
- NONDETERMINISTICALLY SELECTIVE SETS (Q4867411) (← links)