4850 search results - page 160 / 970 » Proof and Computation in Geometry |
186
click to vote
IMR
1999
Springer
15 years 10 months ago
1999
Springer
Considerable progress has been made on automatic hexahedral mesh generation in recent years. Several automatic meshing algorithms have proven to be very reliable on certain classe...
136
click to vote
BIRTHDAY
1999
Springer
15 years 10 months ago
1999
Springer
We discuss the use of weakening and strengthening steps in calculational proofs. We present a metatheorem concerning monotonicity of positions in a formula that should have a more...
175
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
We prove that QIP(2), the class of problems having two-message quantum interactive proof systems, is a subset of PSPACE. This relationship is obtained by means of an efficient pa...
163
click to vote
CSR
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we classify several algorithmic problems in group theory in the classes PZK and SZK (problems with perfect/statistical zero-knowledge proofs respectively). Prior to ...
185
click to vote
TCS
2011
15 years 1 months ago
2011
We provide new correctness criteria for all fragments (multiplicative, exponential, additive) of linear logic. We use these criteria for proving that deciding the correctness of a...