Sciweavers

2693 search results - page 64 / 539
» On Computing Complex Navigation Functions
Sort
View
DAGSTUHL
2007
13 years 11 months ago
Classical Simulation Complexity of Quantum Branching Programs
We present classical simulation techniques for measure once quantum branching programs. For bounded error syntactic quantum branching program of width w that computes a function w...
Farid M. Ablayev
ICALT
2008
IEEE
14 years 4 months ago
Learning Application Suite Creating and Playing SCORM Compatible Web and Computer Based Training
In the process of developing Web Based Training (WBT) applications, the Sharable Content Object Reference Model (SCORM) has become the most common eLearning standard making it pos...
Marco Nordmann, Jens Neumann
ICALP
2009
Springer
14 years 10 months ago
Limiting Negations in Formulas
Negation-limited circuits have been studied as a circuit model between general circuits and monotone circuits. In this paper, we consider limiting negations in formulas. The minimu...
Hiroki Morizumi
ITA
2006
13 years 10 months ago
Complexity classes for membrane systems
Abstract. We compare various computational complexity classes defined within the framework of membrane systems, a distributed parallel computing device which is inspired from the f...
Antonio E. Porreca, Giancarlo Mauri, Claudio Zandr...
IWPEC
2010
Springer
13 years 7 months ago
Multivariate Complexity Analysis of Swap Bribery
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swa...
Britta Dorn, Ildikó Schlotter