3228 search results - page 404 / 646 » Computationally Sound Proofs |
125
click to vote
JC
2008
15 years 3 months ago
2008
Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families. The basic computation model used is the arithmetic circuit, which ma...
130
click to vote
JSW
2008
15 years 3 months ago
2008
A protocol for assuring the authenticity of information broadcasted over long periods of time is proposed. The protocol is based on time synchronization and uses one-way chains con...
141
click to vote
NC
2008
15 years 3 months ago
2008
We consider spiking neural P systems with rules allowed to introduce zero, one, or more spikes at the same time. The motivation comes both from constructing small universal systems...
116
click to vote
GC
2007
Springer
15 years 3 months ago
2007
Springer
Let Γ be a finite digraph and let G be a subgroup of the automorphism group of Γ. A directed cycle C of Γ is called G-consistent whenever there is an element of G whose restri...
135
Voted
CAD
2005
Springer
15 years 3 months ago
2005
Springer
This paper describes an approach at Volvo Truck Corporation where geometry users' requirements are utilised to define configurable product views. The paper is derived from a ...