Parameterized Resolution with bounded conjunction

Details Parameterized Resolution with bounded conjunction Parameterized Resolution with bounded conjunction

2012-04-13

arxiv.org/abs/1204.2983v1

Computer Science

Logic in Computer Science

Scientific paper

We provide separations between the parameterized versions of Res(1)
(Resolution) and Res(2). Using a different set of parameterized contradictions,
we also separate the parameterized versions of Res*(1) (tree-Resolution) and
Res*(2).

Affiliated with

Also associated with

No associations

Rating

Parameterized Resolution with bounded conjunction does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Parameterized Resolution with bounded conjunction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parameterized Resolution with bounded conjunction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-144118