Sciweavers

793 search results - page 37 / 159
» Argumentation and standards of proof
Sort
View
113
Voted
JCSS
2008
96views more  JCSS 2008»
15 years 24 days ago
A combinatorial characterization of resolution width
We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context...
Albert Atserias, Víctor Dalmau
84
Voted
TCS
2008
15 years 22 days ago
Seminormal rings (following Thierry Coquand)
The Traverso-Swan theorem says that a reduced ring A is seminormal if and only if the natural homomorphism Pic A Pic A[X] is an isomorphism ([18, 17]). We give here all the detai...
Henri Lombardi, Claude Quitté
TVCG
2010
174views more  TVCG 2010»
14 years 11 months ago
Subdivision Analysis of the Trilinear Interpolant
— Isosurfaces are fundamental volumetric visualization tools, and are generated by the well-known Marching Cubes cases that approximate contours of trilinearly-interpolated scala...
Hamish Carr, Nelson Max
86
Voted
CSL
1994
Springer
15 years 5 months ago
Resolution Games and Non-Liftable Resolution Orderings
We prove the completeness of the combination of ordered resolution and factoring for a large class of non-liftable orderings, without the need for any additional rules like satura...
Hans de Nivelle
94
Voted
ASIACRYPT
2005
Springer
15 years 6 months ago
Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
Abstract We provide evidence that the unforgeability of several discrete-log based signatures like Schnorr signatures cannot be equivalent to the discrete log problem in the standa...
Pascal Paillier, Damien Vergnaud