The following pages link to Osamu Watanabe (Q354651):
Displaying 50 items.
- Is Valiant-Vazirani's isolation probability improvable? (Q354652) (← links)
- Message passing algorithms for MLS-3LIN problem (Q378230) (← links)
- Propagation connectivity of random hypergraphs (Q426773) (← links)
- Interval graph representation with given interval and intersection lengths (Q491160) (← links)
- Local restrictions from the Furst-Saxe-Sipser paper (Q519884) (← links)
- Games with uniqueness properties (Q705062) (← links)
- A short implicant of a CNF formula with many satisfying assignments (Q727982) (← links)
- Finding most likely solutions (Q733750) (← links)
- On the p-isomorphism conjecture (Q758202) (← links)
- Space efficient separator algorithms for planar graphs (Q782148) (← links)
- Notes on theta functions for open Riemann surfaces (Q795961) (← links)
- Substring search and repeat search using factor oracles (Q835049) (← links)
- On the complexity of kings (Q846367) (← links)
- Randomized algorithms for 3-SAT (Q870448) (← links)
- Kolmogorov complexity and degrees of tally sets (Q916650) (← links)
- Provably fast training algorithms for support vector machines (Q927401) (← links)
- Average-case analysis for the MAX-2SAT problem (Q964385) (← links)
- Scale free interval graphs (Q1035692) (← links)
- On one-one polynomial time equivalence relations (Q1068536) (← links)
- Internal time, general internal variable, and multi-yield-surface theories of plasticity and creep: A unification of concepts (Q1089161) (← links)
- Constitutive modeling of cyclic plasticity and creep, using an internal time concept (Q1089162) (← links)
- A comparison of polynomial time completeness notions (Q1097692) (← links)
- On hardness of one-way functions (Q1097693) (← links)
- Partial Occam's Razor and its applications (Q1127393) (← links)
- Reproducing differentials and certain theta functions on open Riemann surfaces (Q1155751) (← links)
- A fast algorithm for finding all shortest paths (Q1157176) (← links)
- On polynomial time one-truth-table reducibility to a sparse set (Q1191028) (← links)
- Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P (Q1193633) (← links)
- On polynomial-time Turing and many-one completeness in PSPACE (Q1193869) (← links)
- A decomposition of meromorphic differentials and its applications (Q1243392) (← links)
- Theory of meromorphic differentials with infinitely many poles on open Riemann surfaces (Q1243393) (← links)
- Boolean operations, joins, and the extended low hierarchy (Q1275091) (← links)
- The query complexity of learning DFA (Q1336037) (← links)
- On closure properties of GapP (Q1337146) (← links)
- Upward separation for FewP and related classes (Q1341678) (← links)
- Application of crystal plasticity to plastic behavior at notched plate and crack propagation (Q1579981) (← links)
- Adaptive sampling methods for scaling up knowledge discovery algorithms (Q1597451) (← links)
- On the optimality of lattices for the Coppersmith technique (Q1745898) (← links)
- On closure properties of \(\#\text{P}\) in the context of \(\text{PF} \circ \#\text{P}\) (Q1816726) (← links)
- The time-precision tradeoff problem on on-line probabilistic Turing machines (Q1838301) (← links)
- The difference between polynomial-time many-one and truth-table reducibilities on distributional problems (Q1849751) (← links)
- On symmetry of information and polynomial time invertibility (Q1898110) (← links)
- On random hard sets for NP (Q1917082) (← links)
- Crystal plasticity: Micro-shear banding in polycrystals using Voronoi tessellation (Q1973641) (← links)
- Resource-bounded measure and learnability (Q1974447) (← links)
- The robustness of LWPP and WPP, with an application to graph reconstruction (Q2027204) (← links)
- Polynomial size linear programs for problems in \textsc{P} (Q2312647) (← links)
- Relativized collapsing between BPP and PH under stringent oracle access (Q2390241) (← links)
- The query complexity of witness finding (Q2411034) (← links)
- Distributions in the Ehrenfest process (Q2496091) (← links)
