Parameterized Proof Complexity and W[1]

Details Parameterized Proof Complexity and W[1] Parameterized Proof Complexity and W[1]

2012-03-23

arxiv.org/abs/1203.5323v1

Computer Science

Logic in Computer Science

Scientific paper

We initiate a program of parameterized proof complexity that aims to provide
evidence that FPT is different from W[1]. A similar program already exists for
the classes W[2] and W[SAT]. We contrast these programs and prove upper and
lower bounds for W[1]-parameterized Resolution.

Affiliated with

Also associated with

No associations

Rating

Parameterized Proof Complexity and W[1] 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 Proof Complexity and W[1], we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parameterized Proof Complexity and W[1] will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-473072