|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3 occurrences of 3 keywords
|
|
|
|
|
Results
Found 20 publication records. Showing 20 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Masaki Yamamoto, Shuji Kijima, Yasuko Matsui |
A polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise.  |
J. Comb. Optim.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Masaki Yamamoto |
A tighter lower bound on the circuit size of the hardest Boolean functions. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto |
An exact algorithm for the Boolean connectivity problem for k-CNF. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomonori Ando, Yoshiyuki Kabashima, Hisanao Takahashi, Osamu Watanabe, Masaki Yamamoto |
Spectral Analysis of Random Sparse Matrices. |
IEICE Transactions |
2011 |
DBLP BibTeX RDF |
|
| 1 | Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto |
Derandomizing HSSW Algorithm for 3-SAT |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto |
Derandomizing HSSW Algorithm for 3-SAT. |
COCOON |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Masaki Yamamoto |
A combinatorial analysis for the critical clause tree. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Osamu Watanabe, Masaki Yamamoto |
Average-case analysis for the MAX-2SAT problem. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto |
On the Boolean connectivity problem for Horn relations. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto |
An Exact Algorithm for the Boolean Connectivity Problem for k-CNF. |
SAT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Masaki Yamamoto, Shuji Kijima, Yasuko Matsui |
A Polynomial-Time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise. |
COCOON |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Yoshida, Masaki Yamamoto, Hiro Ito |
An improved constant-time approximation algorithm for maximum~matchings. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
constant-time approximation algorithms, minimum vertex cover, property testing, maximum matching, minimum set cover |
| 1 | Tobias Riege, Jörg Rothe, Holger Spakowski, Masaki Yamamoto |
An improved exact algorithm for the domatic number problem. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto |
A Dichotomy Theorem within Schaefer for the Boolean Connectivity Problem. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto |
On the Boolean Connectivity Problem for Horn Relations. |
SAT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Masaki Yamamoto |
A Spectral Method for MAX2SAT in the Planted Solution Model. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Riege, Jörg Rothe, Holger Spakowski, Masaki Yamamoto |
An Improved Exact Algorithm for the Domatic Number Problem |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Masaki Yamamoto |
Generating Instances for MAX2SAT with Optimal Solutions. |
Theory Comput. Syst. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Osamu Watanabe, Masaki Yamamoto |
Average-Case Analysis for the MAX-2SAT Problem. |
SAT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Masaki Yamamoto |
An Improved O(1.234m)-Time Deterministic Algorithm for SAT. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #20 of 20 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")