In computational complexity theory, the parallel computation thesis is a hypothesis which states that the time used by a (reasonable) parallelâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Nachum Dershowitz, Evgenia Falkovich-Derzhavetz
- Logic Journal of the IGPL
- 2016

We develop a generic programming language for parallel algorithms, one that works for all data structures and control structuresâ€¦Â (More)

Is this relevant?

Review

2006

Review

2006

- Damien Woods
- UC
- 2006

This work concerns the computational complexity of a model of computation that is inspired by optical computers. The model isâ€¦Â (More)

Is this relevant?

2005

2005

- Damien Woods, J. Paul Gibson
- Natural Computing
- 2005

This work is concerned with the computational complexity of a model of computation that is inspired by optical computers. Weâ€¦Â (More)

Is this relevant?

2005

2005

- Damien Woods, Ronan G. Reilly, +4 authors Damian Murphy
- 2005

We investigate the computational complexity of an optically inspired model of computation. The model is called the continuousâ€¦Â (More)

Is this relevant?

2005

2005

- Damien Woods
- ISAAC
- 2005

We present upper bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM timeâ€¦Â (More)

Is this relevant?

1990

1990

- Constantine N. K. Osiakwan, Selim G. Akl
- SPDP
- 1990

There are efficient sequential algorithms that use linear programming (LP) for computing maximum weight matchings. Pinding aâ€¦Â (More)

Is this relevant?

1989

1989

- Patrick W. Dymond, Stephen A. Cook
- Inf. Comput.
- 1989

The parallel resources time and hardware and the complexity classes defined by them are studied using the aggregafe model. Theâ€¦Â (More)

Is this relevant?

1989

1989

- Ian Parberry
- IEEE Trans. Computers
- 1989

Nondeterministic analogues of the well-known classes NC and SC, d d NNC and NSC, respectively, are investigated. Addingâ€¦Â (More)

Is this relevant?

1986

1986

- Ian Parberry
- SIGA
- 1986

It is reasonable to expect parallel machines to be faster than sequential ones. But exactly how much faster do we expect them toâ€¦Â (More)

Is this relevant?

1983

1983

- Norbert Blum
- Inf. Process. Lett.
- 1983

Among others, Borodin [l], Chandra and Stockmeyer [3] and Goldschlager [6] mention that there is evidence that parallel time andâ€¦Â (More)

Is this relevant?