83 search results - page 9 / 17 » Hardness Amplification in Proof Complexity |
144
Voted
FUN
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
125
Voted
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
140
click to vote
ICS
2010
Tsinghua U.
15 years 6 months ago
2010
Tsinghua U.
: We study the weight distribution and list-decoding size of Reed-Muller codes. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with a w...
111
click to vote
CSL
2007
Springer
15 years 8 months ago
2007
Springer
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
124
click to vote
EKAW
1994
Springer
15 years 6 months ago
1994
Springer
Formal knowledge modelling languages have a number of advantages over informal languages, such as their precise meaning and the possibility to derive propertiesthrough formal proof...