608 search results - page 24 / 122 » Tests, Proofs and Refinements |
71
Voted
CCCG
2004
15 years 1 months ago
2004
We investigate a question initiated in the work of Sibley and Wagon, who proved that 3 colors suffice to color any collection of 2D parallelograms glued edge-to-edge. Their proof ...
APAL
2005
15 years 11 days ago
2005
We present an extension of Heyting Arithmetic in finite types called Uniform Heyting Arithmetic (HAu) that allows for the extraction of optimized programs from constructive and cla...
87
Voted
ECCC
2010
15 years 16 days ago
2010
We present an alternate proof of the result by Kabanets and Impagliazzo that derandomizing polynomial identity testing implies circuit lower bounds. Our proof is simpler, scales b...
119
Voted
IPL
2007
15 years 11 days ago
2007
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
89
Voted
EWC
2008
15 years 15 days ago
2008
In parallel adaptive mesh refinement (AMR) computations the problem size can vary significantly during a simulation. The goal here is to explore the performance implications of dyn...