Sciweavers

5 search results - page 1 / 1
» coco 1999
Sort
View
COCO
1999
Springer
79views Algorithms» more  COCO 1999»
13 years 10 months ago
Non-Automatizability of Bounded-Depth Frege Proofs
In this paper, we show how to extend the argument due to Bonet, Pitassi and Raz to show that bounded-depth Frege proofs do not have feasible interpolation, assuming that factoring...
Maria Luisa Bonet, Carlos Domingo, Ricard Gavald&a...
COCO
1999
Springer
101views Algorithms» more  COCO 1999»
13 years 10 months ago
A Lower Bound for Primality
Recent work by Bernasconi, Damm and Shparlinski showed that the set of square-free numbers is not in AC0 , and raised as an open question whether similar (or stronger) lower bound...
Eric Allender, Michael E. Saks, Igor Shparlinski
ICNP
1999
IEEE
13 years 10 months ago
Automated Protocol Implementations Based on Activity Threads
In this paper we present a new approach for the automated mapping of formal descriptions into activity thread implementations. Our approach resolves semantic conflicts by reorderi...
Peter Langendörfer, Hartmut König