10 search results - page 2 / 2 » Combinatorial PCPs with Short Proofs |
JCT
2011
12 years 11 months ago
2011
Abstract. Based on the ideas in [CKP], we introduce the weighted analogue of the branching rule for the classical hook length formula, and give two proofs of this result. The firs...
STOC
2006
ACM
14 years 4 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
JCT
2011
12 years 11 months ago
2011
Let W be a finite reflection group. For a given w ∈ W, the following assertion may or may not be satisfied: (∗) The principal Bruhat order ideal of w contains as many elemen...
ECCC
2010
13 years 3 months ago
2010
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dan...
IJCAI
2003
13 years 5 months ago
2003
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...