1199 search results - page 38 / 240 » Parameterized Proof Complexity |
121
Voted
JCSS
2002
15 years 2 months ago
2002
The exact complexity of the weak pigeonhole principle is an old and fundamental problem in proof complexity. Using a diagonalization argument, Paris, Wilkieand Woods 16] showed ho...
100
click to vote
IWPEC
2004
Springer
15 years 7 months ago
2004
Springer
Based on a series of known and new examples, we propose the generalized setting of “distance from triviality” measurement as a reasonable and prospective way of determining use...
139
click to vote
ICPADS
1998
IEEE
15 years 6 months ago
1998
IEEE
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
115
Voted
WSC
2008
15 years 4 months ago
2008
Cluster tools play an important role in modern semiconductor fabs. Due to their complexity in configuration and their varying material flow, the creation of accurate throughput mo...
155
click to vote
FSTTCS
2005
Springer
15 years 8 months ago
2005
Springer
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...