Osamu Watanabe

Osamu Watanabe, Rainer Schuler, Wolfgang Lindner, 1998, Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247).

Computational model for neural representation of multiple disparities

Osamu Watanabe, Masanori Idesawa, O. Watanabe, 2003, Neural Networks.

An improvement of the algorithm of Hertli for the unique 3SAT problem

Osamu Watanabe, Tong Qin, 2020, Theor. Comput. Sci..

Adaptive Sampling Methods for Scaling Up Knowledge Discovery Algorithms

Osamu Watanabe, Carlos Domingo, Ricard Gavaldà, 1999, Discovery Science.

On a Generalized Ruin Problem

Osamu Watanabe, Paul M. B. Vitányi, John Tromp, 2001, RANDOM-APPROX.

On Nonadaptive Reductions to the Set of Random Strings and Its Dense Subsets

Osamu Watanabe, Shuichi Hirahara, 2019, Electron. Colloquium Comput. Complex..

Boolean Operations, Joins, and the Extended Low Hierarchy

Jörg Rothe, Osamu Watanabe, Lane A. Hemaspaandra, 1998, Theor. Comput. Sci..

Limits of Minimum Circuit Size Problem as Oracle

Osamu Watanabe, Shuichi Hirahara, Shuichi Hirahara, 2016, CCC.

Polynomial size linear programs for non-bipartite matching problems and other problems in P pdf

Osamu Watanabe, Hans Raj Tiwary, David Avis, 2014, ArXiv.

Average-case analysis for the MAX-2SAT problem

Osamu Watanabe, Masaki Yamamoto, 2010, Theor. Comput. Sci..

The Robustness of LWPP and WPP, with an Application to Graph Reconstruction

Osamu Watanabe, Edith Hemaspaandra, Lane A. Hemaspaandra, 2017, computational complexity.

Instance complexity

Osamu Watanabe, Pekka Orponen, Ker-I Ko, 1994, JACM.

Finding Most Likely Solutions

Osamu Watanabe, Mikael Onsjö, O. Watanabe, 2007, Theory of Computing Systems.

On closure properties of GapP

Osamu Watanabe, Thomas Thierauf, Seinosuke Toda, 2005, computational complexity.

Hard instance generation for SAT

Osamu Watanabe, Satoshi Horie, 1998, ArXiv.

Õ(√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability

Osamu Watanabe, David G. Kirkpatrick, Tetsuo Asano, 2014, MFCS.

What Is a Hard Instance of a Computational Problem?

Osamu Watanabe, Pekka Orponen, Ker-I Ko, 1986, SCT.

ELC International Meeting on Inference, Computation, and Spin Glasses (ICSG2013)

Osamu Watanabe, Yoshiyuki Kabashima, Jun-ichi Inoue, 2013 .

Deterministic Application of Grover's Quantum Search Algorithm

Osamu Watanabe, Kyoichi Okamoto, 2001, COCOON.

The Orientation Selectivity Problem : An Approach from Theoretical Computer Science

Osamu Watanabe, Tadashi Yamazaki, Tadashi Yamazaki, 1998 .

Preface

Osamu Watanabe, Arun Sharma, 2002, Theor. Comput. Sci..

On Polynomial-Time Turing and Many-One Completeness in PSPACE

Osamu Watanabe, Shouwen Tang, 1992, Theor. Comput. Sci..

A framework for polynomial-time query learnability

Osamu Watanabe, 2005, Mathematical systems theory.

The Time-Precision Tradeoff Problem on On-Line Probabilistic Turing Machines

Osamu Watanabe, 1983, Theor. Comput. Sci..

Upward Separation for FewP and Related Classes

Jörg Rothe, Osamu Watanabe, Rajesh P. N. Rao, 1994, Inf. Process. Lett..

Nonlinearity of the population activity to transparent motion

Osamu Watanabe, Masayuki Kikuchi, O. Watanabe, 2005, Neural Networks.

Polynomially Sparse Variations and Reducibility among Prediction Problems

Osamu Watanabe, Naoki Abe, 1992 .

Partial Occam's Razor and Its Applications

Osamu Watanabe, Carlos Domingo, Tatsuie Tsukiji, 1997, ALT.

Propagation Connectivity of Random Hypergraphs

Osamu Watanabe, Mikael Onsjö, Amin Coja-Oghlan, 2010, APPROX-RANDOM.

Games with a Uniqueness Property

Osamu Watanabe, Kenneth W. Regan, Shin Aida, 2002, STACS.

Stringent Relativization

Osamu Watanabe, Jin-Yi Cai, Jin-Yi Cai, 2003, FSTTCS.

A Stereo Algorithm with Occlusion Constraint

Osamu Watanabe, Kunihiko Fukushima, K. Fukushima, 1997 .

On ≤1-ttp-Sparseness and Nondeterministic Complexity Classes (Extended Abstract)

Osamu Watanabe, 1988, ICALP.

The query complexity of learning DFA

Osamu Watanabe, José L. Balcázar, Josep Díaz, 1994, New Generation Computing.

Relating Equivalence and Reducibility to Sparse Sets

Osamu Watanabe, Eric Allender, Lane A. Hemaspaandra, 1992, SIAM J. Comput..

Structural Analyses on the Complexity of Inverting Functions

Osamu Watanabe, Seinosuke Toda, 1990, SIGAL International Symposium on Algorithms.

Test instance generation for promised NP search problems

Osamu Watanabe, 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

Local Restrictions from the Furst-Saxe-Sipser Paper

Osamu Watanabe, Suguru Tamaki, 2016, Theory of Computing Systems.

Development of Finite Element Model by Structure Assembly Method: Application to 3 Dimensional Modeling

Osamu Watanabe, 2010 .

Structure from Stereopsis without Point-to-Point Correspondence

Osamu Watanabe, Kunihiko Fukushima, K. Fukushima, 1997 .

On tally relativizations of BP-complexity classes

Osamu Watanabe, Shouwen Tang, 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

The Robustness of LWPP and WPP, with an Application to Graph Reconstruction

Osamu Watanabe, Edith Hemaspaandra, Lane A. Hemaspaandra, 2020, Comput. Complex..

Partial Occam's Razor and its Applications

Osamu Watanabe, Carlos Domingo, Tatsuie Tsukiji, 1997, Inf. Process. Lett..

Exact global motion compensation for holographic video compression.

Osamu Watanabe, Colas Schretter, David Blinder, 2019, Applied optics.

On Polynomial Time One-Truth-Table Reducibility to a Sparse Set

Osamu Watanabe, 1992, J. Comput. Syst. Sci..

Structural analysis of polynomial-time query learnability

Osamu Watanabe, Ricard Gavaldà, 2005, Mathematical systems theory.

Randomized Approximation of the Constraint Satisfaction Problem (Extended Abstract)

Osamu Watanabe, Hoong Chuin Lau, 1996, SWAT.

An optimal parallel algorithm for learning DFA

Osamu Watanabe, José L. Balcázar, Josep Díaz, 1994, COLT '94.

On polynomial time bounded truth-table reducibility of NP sets to sparse sets

Osamu Watanabe, Mitsunori Ogihara, 1990, STOC '90.

On the p-Isomorphism Conjecture

Osamu Watanabe, 1991, Theor. Comput. Sci..

Kolmogorov Complexity and Degrees of Tally Sets

Osamu Watanabe, Eric Allender, 1990, Inf. Comput..

Randomized Algorithms for 3-SAT

Osamu Watanabe, Rainer Schuler, Uwe Schöning, 2007, Theory of Computing Systems.

Structural analysis of the complexity of inverse functions

Osamu Watanabe, Seinosuke Toda, 2005, Mathematical systems theory.

From Computational Learning Theory to Discovery Science

Osamu Watanabe, 1999, ICALP.

Polynomial Time 1-Turing Reductions from #PH to #P

Osamu Watanabe, Seinosuke Toda, Seinosuke Toda, 1992, Theor. Comput. Sci..

On Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets

Osamu Watanabe, Mitsunori Ogihara, 1991, SIAM J. Comput..

On polynomial time Turing and many-one completeness in PSPACE

Osamu Watanabe, Shouwen Tang, 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

On the Optimality of Lattices for the Coppersmith Technique

Osamu Watanabe, Manindra Agrawal, Yoshinori Aono, 2012, ACISP.

A Formal Study of Learning via Queries

Osamu Watanabe, 1990, ICALP.

On Nonadaptive Security Reductions of Hitting Set Generators

Osamu Watanabe, Shuichi Hirahara, Shuichi Hirahara, 2020, APPROX-RANDOM.

On Random Hard Sets for NP

Osamu Watanabe, Ronald V. Book, 1996, Inf. Comput..

Average-Case Analysis for the MAX-2SAT Problem

Osamu Watanabe, Masaki Yamamoto, 2006, SAT.

On Tally Relativizations of BP-Complexity Classes

Osamu Watanabe, Shouwen Tang, 1989, SIAM J. Comput..

Stress and Strain Locus of Perforated Plate in Inelastic Deformation—Strain-Controlled Loading Case

Osamu Watanabe, Akihiro Matsuda, Bopit Bubphachot, 2012 .

A new analytical method for characterizing nonlinear visual processes with stimuli of arbitrary distribution: Theory and applications.

Osamu Watanabe, Shin'ya Nishida, Hiroki Yokoyama, 2017, Journal of vision.

On Random Hard Sets for NP

Osamu Watanabe, Ronald V. Book, 1994, ISAAC.

PREDICTION OF GROUND SETTLEMENTS ASSOCIATED WITH SHIELD TUNNELLING

Osamu Watanabe, Nobuo Takagi, Wataru Yoshikoshi, 1978 .

Substring search and repeat search using factor oracles

Osamu Watanabe, Ryoichi Kato, 2005, Inf. Process. Lett..

A Short Implicant of a CNF Formula with Many Satisfying Assignments

Osamu Watanabe, Daniel M. Kane, 2014, ISAAC.

Scale free interval graphs

Osamu Watanabe, Ryuhei Uehara, Naoto Miyoshi, 2008, Theor. Comput. Sci..

A Note on the Query Complexity of Learning DFA (Extended Abstract)

Osamu Watanabe, José L. Balcázar, Josep Díaz, 1992, ALT.

Relating equivalence and reducibility to sparse sets

Osamu Watanabe, Eric Allender, Lane A. Hemaspaandra, 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

A neural model for stereo transparency with the population of the disparity energy models

Osamu Watanabe, O. Watanabe, 2006, Neurocomputing.

Peeling Algorithm on Random Hypergraphs with Superlinear Number of Hyperedges pdf

Osamu Watanabe, Ryuhei Mori, R. Mori, 2015, ArXiv.

Application of Free Mesh Method to Elasto-Plastic Large Deformation Problem.

Osamu Watanabe, Fuyuki Segawa, 1999 .

Estimating the Gowers Norm of Modulo Functions over Prime Fields

Osamu Watanabe, Akinori Kawachi, Hidetoki Tanaka, 2012, IEICE Trans. Inf. Syst..

A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques

Osamu Watanabe, Yushi Uno, Takeya Shigezumi, 2011, J. Graph Algorithms Appl..

On Sets Bounded Truth-Table Reducible to P-Selective Sets

Osamu Watanabe, Thomas Thierauf, Seinosuke Toda, 1996, RAIRO Theor. Informatics Appl..

Blockpfropfcopolymere and manufacturing processes it.

Osamu Watanabe, Koichi Ito, Teruo Fujimoto, 1987 .

On Symmetry of Information and Polynomial Time Invertibility

Osamu Watanabe, Luc Longpré, L. Longpré, 1992, Inf. Comput..

Numerical Simulation of a Viscous Flow with Free -Surface Wave about a Ship by a Finite-Volume Method

Osamu Watanabe, Ming Zhu, Hideaki Miyata, 1992 .

Relating Sublinear Space Computability Among Graph Connectivity and Related Problems

Osamu Watanabe, Tatsuya Imai, 2016, SOFSEM.

Stochastic Algorithms: Foundations and Applications, 5th International Symposium, SAGA 2009, Sapporo, Japan, October 26-28, 2009. Proceedings

Osamu Watanabe, Thomas Zeugmann, T. Zeugmann, 2009, SAGA.

Is Valiant-Vazirani's Isolation Probability Improvable?

Osamu Watanabe, Dieter van Melkebeek, Valentine Kabanets, 2012, Computational Complexity Conference.

On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy: Positive and Negative Results

Osamu Watanabe, Jin-Yi Cai, 2003, COCOON.

Learning r-of-k Functions by Boosting

Osamu Watanabe, Kohei Hatano, 2004, ALT.

Games with Uniqueness Properties

Osamu Watanabe, Kenneth W. Regan, Shin Aida, 2003, Theory of Computing Systems.

Some Heuristic Analysis of Local Search Algorithms for SAT Problems

Osamu Watanabe, O. Watanabe, 2005, SAGA.

A Sublinear-space and Polynomial-time Separator Algorithm for Planar Graphs

Osamu Watanabe, N. V. Vinodchandran, Tatsuya Imai, 2019, Electron. Colloquium Comput. Complex..

A Role of Constraint in Self-Organization

Osamu Watanabe, Tadashi Yamazaki, Carlos Domingo, 1998, RANDOM.

Proceedings of the 10th International Conference on Algorithmic Learning Theory

Osamu Watanabe, Takashi Yokomori, T. Yokomori, 1999 .

Practical Algorithms for On-line Sampling

Osamu Watanabe, Carlos Domingo, Ricard Gavaldà, 1998, Discovery Science.

On the Complexity of Small Description and Related Topics

Osamu Watanabe, 1992, MFCS.

A Probabilistic 3-SAT Algorithm Further Improved

Osamu Watanabe, Rainer Schuler, Uwe Schöning, 2002, STACS.

On the computational complexity of small descriptions

Osamu Watanabe, Ricard Gavaldà, 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

Query Complexity and Error Tolerance of Witness Finding Algorithms

Osamu Watanabe, Benjamin Rossman, Akinori Kawachi, 2012, Electron. Colloquium Comput. Complex..

Coding Complexity: The Computational Complexity of Succinct Descriptions

Osamu Watanabe, José L. Balcázar, Ricard Gavaldà, 1997, Advances in Algorithms, Languages, and Complexity.

Orientation Selectivity: An Approach from Theoretical Computer Science

Osamu Watanabe, Tadashi Yamazaki, 1996 .

Evaluations of Hash Distributed A* in Optimal Sequence Alignment

Osamu Watanabe, Akihiro Kishimoto, Yoshikazu Kobayashi, 2011, IJCAI.

Interval graph representation with given interval and intersection lengths

Osamu Watanabe, Johannes Köbler, Sebastian Kuhnert, 2012, J. Discrete Algorithms.

Sequential Sampling Algorithms: Unified Analysis and Lower Bounds

Osamu Watanabe, Ricard Gavaldà, Ricard Gavaldà, 2001, SAGA.

Computational and Statistical Indistinguishabilities

Osamu Watanabe, Kaoru Kurosawa, K. Kurosawa, 1992, ISAAC.

Adaptive Sampling Methods for Scaling Up Knowledge Discovery Algorithms

Osamu Watanabe, Carlos Domingo, Ricard Gavaldà, 1999, Data Mining and Knowledge Discovery.

On the structure of interactable complexity classes

Osamu Watanabe, 1987 .

One-Way Functions and the Berman-Hartmanis Conjecture

Osamu Watanabe, Manindra Agrawal, 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

On the Complexity of Kings

Osamu Watanabe, Edith Hemaspaandra, Lane A. Hemaspaandra, 2007, FCT.

An Improvement of the Algorithm of Hertli for the Unique 3SAT Problem

Osamu Watanabe, Tong Qin, O. Watanabe, 2017, WALCOM.

Scaling Up a Boosting-Based Learner via Adaptive Sampling

Osamu Watanabe, Carlos Domingo, Carlos Domingo, 2000, PAKDD.

On Exponential Lowness

Osamu Watanabe, Pekka Orponen, Ronald V. Book, 1986, ICALP.

On intractability of the classUP

Osamu Watanabe, 2005, Mathematical systems theory.

O(sqrt(n))-Space and Polynomial-time Algorithm for the Planar Directed Graph Reachability Problem

Osamu Watanabe, David G. Kirkpatrick, Tetsuo Asano, 2014, Electron. Colloquium Comput. Complex..

The Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems

Osamu Watanabe, Rainer Schuler, Shin Aida, 2002, Theory of Computing Systems.

Propagation Connectivity of Random Hypergraphs

Osamu Watanabe, Mikael Onsjö, Amin Coja-Oghlan, 2012, Electron. J. Comb..

Stereo transparency in ambiguous stereograms generated by overlapping two identical dot patterns.

Osamu Watanabe, O. Watanabe, 2009, Journal of vision.

Proceedings - 23rd Annual IEEE Conference on Computational Complexity, CCC 2008: Preface

Yael Tauman Kalai, Osamu Watanabe, Yuval Ishai, 2008 .

Spectral Analysis of Random Sparse Matrices

Osamu Watanabe, Yoshiyuki Kabashima, Masaki Yamamoto, 2011, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

On Sets Bounded Truth-Table Reducible to P-Selective Sets

Osamu Watanabe, Thomas Thierauf, Seinosuke Toda, 1994, RAIRO Theor. Informatics Appl..

Sequential Sampling Techniques for Algorithmic Learning Theory

Osamu Watanabe, 2000, ALT.

Evaluating Root Parallelization in Go

Osamu Watanabe, Akihiro Kishimoto, Yusuke Soejima, 2010, IEEE Transactions on Computational Intelligence and AI in Games.

Linear Programming Relaxations for Goldreich's Generators over Non-Binary Alphabets pdf

Osamu Watanabe, Takeshi Koshiba, Ryuhei Mori, 2014, ArXiv.

How Can Computer Science Contribute to Knowledge Discovery?

Osamu Watanabe, 2001, SOFSEM.

A view of structural complexity theory

Osamu Watanabe, Ronald V. Book, 1989, Bull. EATCS.

A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques

Osamu Watanabe, Yushi Uno, Takeya Shigezumi, 2010, J. Graph Algorithms Appl..

Special Section on Theoretical Foundation of Computing

Toshihide Ibaraki, Osamu Watanabe, 1992 .

Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy

Peter Bro Miltersen, Osamu Watanabe, N. V. Vinodchandran, 1999, COCOON.

New Collapse Consequences of NP Having Small Circuits

Osamu Watanabe, Johannes Köbler, 1995, ICALP.

On One-One Polynomial Time Equivalence Relations

Osamu Watanabe, 1985, Theor. Comput. Sci..

Interval graph representation with given interval and intersection lengths

Osamu Watanabe, Johannes Köbler, Sebastian Kuhnert, 2015, J. Discrete Algorithms.

Is the Valiant-Vazirani Isolation Lemma Improvable?

Osamu Watanabe, Valentine Kabanets, 2011, Electron. Colloquium Comput. Complex..

Proceedings of the 17th international conference on Algorithms and Computation

Osamu Watanabe, Yoshio Okamoto, Takao Asano, 2006 .

On Symmetry of Information and Polynomial Time Invertibility

Osamu Watanabe, Luc Longpré, 1995, Inf. Comput..

A Simple Message Passing Algorithm for Graph Partitioning Problems

Osamu Watanabe, Mikael Onsjö, 2006, ISAAC.

On polynomial time bounded truth-table reducibility of NP sets to sparse sets

Osamu Watanabe, Mitsunori Ogihara, M. Ogihara, 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

Towards average-case complexity analysis of NP optimization problems

Osamu Watanabe, Rainer Schuler, R. Schuler, 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.

STRESS ANALYSIS AND TORSIONAL BUCKLING ANALYSIS OF U-SHAPED BELLOWS

Osamu Watanabe, Hideomi Ohtsubo, O. Watanabe, 1989 .

Theory of Computing Systems (TOCS) Submission Version Finding Most Likely Solutions

Osamu Watanabe, Mikael Onsjö, O. Watanabe, 2009, Theory of Computing Systems.

The Join Can Lower Complexity

Jörg Rothe, Osamu Watanabe, Lane A. Hemaspaandra, 1996, COCOON.

An Improved Randomized Algorithm for 3-SAT

Osamu Watanabe, Rainer Schuler, Uwe Schöning, 2001 .

Random Access to Advice Strings and Collapsing Results

Osamu Watanabe, Jin-Yi Cai, Jin-Yi Cai, 2004, Algorithmica.

Algorithmic Aspects of Boosting

Osamu Watanabe, 2002, Progress in Discovery Science.

Lowness Properties of Sets in the Exponential-Time Hierarchy

Osamu Watanabe, Pekka Orponen, Ronald V. Book, 1988, SIAM J. Comput..

On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems

Osamu Watanabe, Rainer Schuler, Shin Aida, 2001, STACS.

The Propositional Satisfiability Problem -- Algorithms and Lower Bounds (Dagstuhl Seminar 03141)

Osamu Watanabe, Pavel Pudlák, Uwe Schöning, 2021 .

Pseudo Expectation : A Tool for Analyzing Local Search Algorithms

Osamu Watanabe, 2005 .

Weighted random popular matchings

Osamu Watanabe, Toshiya Itoh, 2010 .

On Polynominal Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets (Abstract).

Osamu Watanabe, Mitsunori Ogiwara, 1990 .

Simple Algorithms for Graph Partition Problems

Osamu Watanabe, Mikael Onsjö, 2005 .

On the complexity of kings

Osamu Watanabe, Edith Hemaspaandra, Lane A. Hemaspaandra, 2005, Theor. Comput. Sci..

Relating Equivalence and Reducibility to Sparse Sets (Extended Abstract)

Osamu Watanabe, Eric Allender, Mitsunori OgiwaraS, 1991 .

Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy

Peter Bro Miltersen, Osamu Watanabe, Vinodchandran N. Variyam, 1999 .

Algorithmic Randomness and Complexity (NII Shonan Meeting 2014-10)

Osamu Watanabe, André Nies, Rodney G. Downey, 2014, NII Shonan Meet. Rep..