| Paper Abstract and Keywords |
| Presentation |
2026-05-21 13:20
A Deterministic $O^*(2^{n/2})$-time Algorithm for 2-CNF Satisfiability in a Subspace Atsuki Nagao (Ochanomizu Univ.), Kazuhisa Seto (Hokkaido Univ.), Junichi Teruyama (Univ. of Hyogo) COMP2026-5 |
| Abstract |
(in Japanese) |
(See Japanese page) |
| (in English) |
The problem of $k$-CNF satisfiability in a subspace asks whether there exists an assignment that satisfies both a $k$-CNF formula and a system of $mathbb{F}_2$-linear equations.
Even for $k=2$, known as $2$-SUB-SAT, this problem is NP-complete.
Arvind and Guruswami presented a randomized algorithm for $2$-SUB-SAT that runs in $O^*(1.432^n)$-time.
In this report, we improve the running time to a deterministic $O^*(2^{n/2})$ by providing a new branch-and-bound algorithm. |
| Keyword |
(in Japanese) |
(See Japanese page) |
| (in English) |
$2$-SAT in a subspace / deterministic algorithm / polynomial-space algorithm / / / / / |
| Reference Info. |
IEICE Tech. Rep., vol. 126, no. 28, COMP2026-5, pp. 23-25, May 2026. |
| Paper # |
COMP2026-5 |
| Date of Issue |
2026-05-13 (COMP) |
| ISSN |
Online edition: ISSN 2432-6380 |
Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
| Download PDF |
COMP2026-5 |
| Conference Information |
| Committee |
COMP IPSJ-AL |
| Conference Date |
2026-05-20 - 2026-05-21 |
| Place (in Japanese) |
(See Japanese page) |
| Place (in English) |
Osaka Univ. (Toyonaka) |
| Topics (in Japanese) |
(See Japanese page) |
| Topics (in English) |
Theoretical Computer Science, General |
| Paper Information |
| Registration To |
COMP |
| Conference Code |
2026-05-COMP |
| Language |
English |
| Title (in Japanese) |
(See Japanese page) |
| Sub Title (in Japanese) |
(See Japanese page) |
| Title (in English) |
A Deterministic $O^*(2^{n/2})$-time Algorithm for 2-CNF Satisfiability in a Subspace |
| Sub Title (in English) |
|
| Keyword(1) |
$2$-SAT in a subspace |
| Keyword(2) |
deterministic algorithm |
| Keyword(3) |
polynomial-space algorithm |
| Keyword(4) |
|
| Keyword(5) |
|
| Keyword(6) |
|
| Keyword(7) |
|
| Keyword(8) |
|
| 1st Author's Name |
Atsuki Nagao |
| 1st Author's Affiliation |
Ochanomizu University (Ochanomizu Univ.) |
| 2nd Author's Name |
Kazuhisa Seto |
| 2nd Author's Affiliation |
Hokkaido University (Hokkaido Univ.) |
| 3rd Author's Name |
Junichi Teruyama |
| 3rd Author's Affiliation |
University of Hyogo (Univ. of Hyogo) |
| 4th Author's Name |
|
| 4th Author's Affiliation |
() |
| 5th Author's Name |
|
| 5th Author's Affiliation |
() |
| 6th Author's Name |
|
| 6th Author's Affiliation |
() |
| 7th Author's Name |
|
| 7th Author's Affiliation |
() |
| 8th Author's Name |
|
| 8th Author's Affiliation |
() |
| 9th Author's Name |
|
| 9th Author's Affiliation |
() |
| 10th Author's Name |
|
| 10th Author's Affiliation |
() |
| 11th Author's Name |
|
| 11th Author's Affiliation |
() |
| 12th Author's Name |
|
| 12th Author's Affiliation |
() |
| 13th Author's Name |
|
| 13th Author's Affiliation |
() |
| 14th Author's Name |
|
| 14th Author's Affiliation |
() |
| 15th Author's Name |
|
| 15th Author's Affiliation |
() |
| 16th Author's Name |
|
| 16th Author's Affiliation |
() |
| 17th Author's Name |
|
| 17th Author's Affiliation |
() |
| 18th Author's Name |
|
| 18th Author's Affiliation |
() |
| 19th Author's Name |
|
| 19th Author's Affiliation |
() |
| 20th Author's Name |
|
| 20th Author's Affiliation |
() |
| 21st Author's Name |
|
| 21st Author's Affiliation |
() |
| 22nd Author's Name |
|
| 22nd Author's Affiliation |
() |
| 23rd Author's Name |
|
| 23rd Author's Affiliation |
() |
| 24th Author's Name |
|
| 24th Author's Affiliation |
() |
| 25th Author's Name |
|
| 25th Author's Affiliation |
() |
| 26th Author's Name |
/ / |
| 26th Author's Affiliation |
()
() |
| 27th Author's Name |
/ / |
| 27th Author's Affiliation |
()
() |
| 28th Author's Name |
/ / |
| 28th Author's Affiliation |
()
() |
| 29th Author's Name |
/ / |
| 29th Author's Affiliation |
()
() |
| 30th Author's Name |
/ / |
| 30th Author's Affiliation |
()
() |
| 31st Author's Name |
/ / |
| 31st Author's Affiliation |
()
() |
| 32nd Author's Name |
/ / |
| 32nd Author's Affiliation |
()
() |
| 33rd Author's Name |
/ / |
| 33rd Author's Affiliation |
()
() |
| 34th Author's Name |
/ / |
| 34th Author's Affiliation |
()
() |
| 35th Author's Name |
/ / |
| 35th Author's Affiliation |
()
() |
| 36th Author's Name |
/ / |
| 36th Author's Affiliation |
()
() |
| Speaker |
Author-2 |
| Date Time |
2026-05-21 13:20:00 |
| Presentation Time |
30 minutes |
| Registration for |
COMP |
| Paper # |
COMP2026-5 |
| Volume (vol) |
vol.126 |
| Number (no) |
no.28 |
| Page |
pp.23-25 |
| #Pages |
3 |
| Date of Issue |
2026-05-13 (COMP) |