The following pages link to Boolean Memories (Q5518364):
Displayed 15 items.
- Relaxed Hensel lifting of triangular sets (Q480691) (← links)
- A simple and fast online power series multiplication and its analysis (Q492037) (← links)
- On the power of several queues (Q685436) (← links)
- Linear speed-up does not hold on Turing machines with tree storages (Q688445) (← links)
- On time versus space. II (Q1152954) (← links)
- An information-theoretic approach to time bounds for on-line computation (Q1156484) (← links)
- Simulations among multidimensional Turing machines (Q1165001) (← links)
- A fast implementation of a multidimensional storage into a tree storage (Q1166931) (← links)
- On the sequential nature of functions (Q1232180) (← links)
- Speedup of determinism by alternation for multidimensional Turing machines (Q1341727) (← links)
- Linear-time simulation of multihead Turing machines (Q1825664) (← links)
- The time-precision tradeoff problem on on-line probabilistic Turing machines (Q1838301) (← links)
- Fast on-line integer multiplication (Q1847139) (← links)
- (Q5575562) (← links)
- On the Minimum Computation Time of Functions (Q5582354) (← links)