Sciweavers

2661 search results - page 189 / 533
» Quantum Complexity Classes
Sort
View
CRYPTO
2005
Springer
135views Cryptology» more  CRYPTO 2005»
16 years 2 days ago
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
Ivan Damgård, Yuval Ishai
ECAL
2005
Springer
16 years 1 days ago
Evolutionary Transitions as a Metaphor for Evolutionary Optimisation
Abstract. This paper proposes a computational model for solving optimisation problems that mimics the principle of evolutionary transitions in individual complexity. More specific...
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert
MFCS
2005
Springer
16 years 16 hour ago
Dimension Is Compression
Abstract. Effective fractal dimension was defined by Lutz (2003) in order to quantitatively analyze the structure of complexity classes. Interesting connections of effective dim...
María López-Valdés, Elvira Ma...
WIA
2005
Springer
16 years 1 hour ago
Tree Automata and XPath on Compressed Trees
The complexity of various membership problems for tree automata on compressed trees is analyzed. Two compressed representations are considered: dags, which allow to share identical...
Markus Lohrey, Sebastian Maneth
IDS
1994
139views Database» more  IDS 1994»
15 years 10 months ago
Three Dimensional Interface for an Object Oriented Database
An experimental 3D interface to an object oriented database is described. It is hoped that using such techniques will help make complex data structures more comprehensible and eas...
Martin H. Rapley, Jessie B. Kennedy