Presentation 2022-10-26
A Moderately Exponential Time Satisfiability Algorithm for Linear-Sized Deterministic Width-2 Branching Programs
Tomu Makita, Atsuki Nagao, Tatsuki Okada, Kazuhisa Seto, Junichi Teruyama,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English)
Keyword(in Japanese) (See Japanese page)
Keyword(in English)
Paper # COMP2022-14
Date of Issue 2022-10-19 (COMP)

Conference Information
Committee COMP
Conference Date 2022/10/26(1days)
Place (in Japanese) (See Japanese page)
Place (in English) Kyusyu Univ. Nishijin Plaza
Topics (in Japanese) (See Japanese page)
Topics (in English) Theoretical Computer Science, etc
Chair Hiroyuki Uno(Osaka Metropolitan Univ.)
Vice Chair Shuji Kijima(Shiga Univ.)
Secretary Shuji Kijima(Hosei Univ.)
Assistant Ei Ando(Senshu Univ.)

Paper Information
Registration To Technical Committee on Theoretical Foundations of Computing
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Moderately Exponential Time Satisfiability Algorithm for Linear-Sized Deterministic Width-2 Branching Programs
Sub Title (in English)
Keyword(1)
1st Author's Name Tomu Makita
1st Author's Affiliation Seikei University(Seikei Univ.)
2nd Author's Name Atsuki Nagao
2nd Author's Affiliation Ochanomizu University(Ochanomizu Univ.)
3rd Author's Name Tatsuki Okada
3rd Author's Affiliation Seikei University(Seikei Univ.)
4th Author's Name Kazuhisa Seto
4th Author's Affiliation Hokkaido University(Hokkaido Univ.)
5th Author's Name Junichi Teruyama
5th Author's Affiliation University of Hyogo(Univ. of Hyogo)
Date 2022-10-26
Paper # COMP2022-14
Volume (vol) vol.122
Number (no) COMP-229
Page pp.pp.2-6(COMP),
#Pages 5
Date of Issue 2022-10-19 (COMP)