Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
37
views
0
references
Top references
cited by
13
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,783
similar
All similar
Record
: found
Abstract
: not found
Book
: not found
Complexity of Computer Computations
other
Editor(s):
Raymond E. Miller
,
James W. Thatcher
,
Jean D. Bohlinger
Publication date
(Print):
1972
Publisher:
Springer US
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
ScienceOpen Research
Author and book information
Book
ISBN (Print):
978-1-4684-2003-6
ISBN (Electronic):
978-1-4684-2001-2
Publication date (Print):
1972
DOI:
10.1007/978-1-4684-2001-2
SO-VID:
4ecd77dd-b6f7-4e63-9d74-49c280a46882
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Evaluation of Rational Functions
pp. 31
On Obtaining Upper Bounds on the Complexity of Matrix Multiplication
pp. 105
Permuting Information in Idealized Two-Level Storage
pp. 153
Efficiency of Equivalence Algorithms
pp. 85
Reducibility among Combinatorial Problems
pp. 131
Isomorphism of Planar Graphs (Working Paper)
Similar content
1,783
A new approach to computing the incoherent neutron scattering function
Authors:
V. Laliena
,
J. Dawidowski
,
G.J. Cuello
…
Intelligent Resource Allocation for Video Analytics in Blockchain-Enabled Internet of Autonomous Vehicles With Edge Computing
Authors:
Xiantao Jiang
,
F. Richard Yu
,
Tian Song
…
Repurposing FIASMAs against Acid Sphingomyelinase for COVID-19: A Computational Molecular Docking and Dynamic Simulation Approach.
Authors:
Aliza Naz
,
Sumbul Asif
,
Khairiah Mubarak Alwutayd
…
See all similar
Cited by
13
Routing of multipoint connections
Authors:
B.M. Waxman
Multiple-objective analysis of integrated relief supply and network restoration in humanitarian logistics operations
Authors:
Kasin Ransikarbum
,
Scott J. Mason
Finding Hidden Cliques in Linear Time with High Probability
Authors:
YUVAL PERES
,
ORI GUREL-GUREVICH
,
YAEL DEKEL
See all cited by