Sciweavers

1199 search results - page 38 / 240
» Parameterized Proof Complexity
Sort
View
JCSS
2002
86views more  JCSS 2002»
13 years 8 months ago
A New Proof of the Weak Pigeonhole Principle
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...
Alexis Maciel, Toniann Pitassi, Alan R. Woods
IWPEC
2004
Springer
14 years 2 months ago
A Structural View on Parameterizing Problems: Distance from Triviality
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...
Jiong Guo, Falk Hüffner, Rolf Niedermeier
ICPADS
1998
IEEE
14 years 28 days ago
Symbolic Partitioning and Scheduling of Parameterized Task Graphs
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...
Michel Cosnard, Emmanuel Jeannot, Tao Yang
WSC
2008
13 years 11 months ago
Automated generation and parameterization of throughput models for semiconductor tools
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...
Jan Lange, Kilian Schmidt, Roy Borner, Oliver Rose
FSTTCS
2005
Springer
14 years 2 months ago
Quantitative Models and Implicit Complexity
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...
Ugo Dal Lago, Martin Hofmann