Questions about Parity SAT
- From: Finder <a_plakhoff@xxxxxxx>
- Date: Wed, 16 Jan 2008 05:46:28 -0800 (PST)
Hi everyone,
I've constructed a way to reduce Parity SAT (that is, the question
whether a SAT instance has an odd number of satisfying assignments; a
complete problem for Parity P if I'm not mistaken) to its special case
(which looks much easier) in polynomial time and space.
The special case, which I'll here denote "Parity SAT Positive", is the
same question about SAT instances where all literals are positive
(i.e. every clause doesn't contain negations).
As computational complexity is only my hobby, I have no scientific
advisor. So I would humbly thank anyone who can give me some hints:
1) Is it a new or an already-known result? If second, could you give
me a reference?
2) Does this result have some practical value or it just shows that
even "Parity SAT Positive" is extremely hard?
3) Maybe what I call "Parity SAT Positive" in fact has a
widespread name?
Kind regards,
Andrey Plakhov
.
- Follow-Ups:
- Re: Questions about Parity SAT
- From: Ryan Williams
- Re: Questions about Parity SAT
- From: Radoslaw Hofman
- Re: Questions about Parity SAT
- Prev by Date: Re: Hamiltonian cycle problem in 2-connected bipartite cubic graph is Polynomial
- Next by Date: Re: Hamiltonian cycle problem in 2-connected bipartite cubic graph is Polynomial
- Previous by thread: CFP: 8th International Conference on Hybrid Intelligent Systems (HIS 2008)
- Next by thread: Re: Questions about Parity SAT
- Index(es):
Relevant Pages
|