9 citations · 21 across the 8 of their papers we have counts for
4 papers · 1 filter
Fast quantum verification for the formulas of predicate calculus
Yuri Ozhigov
Quantum algorithm is constructed which verifies the formulas of predicate calculus in time with bounded error probability, where is the time required for classical…
Quantum Computers Speed Up Classical with Probability Zero
Yuri Ozhigov
Let denote length preserving function on words. A classical algorithm can be considered as iterated applications of black box representing , beginning with input word $x…
Lindenmayer systems as a model of computations
Yuri Ozhigov
LS is a particular type of computational processes simulating living tissue. They use an unlimited branching process arising from the simultaneous substitutions of some words inste…
Computations on Nondeterministic Cellular Automata
Yuri Ozhigov
The work is concerned with the trade-offs between the dimension and the time and space complexity of computations on nondeterministic cellular automata. It is proved, that 1). Ever…