0 views

Uploaded by Anonymous s3TzBvwS1

Exercise 3

- Foundations of Mathematics
- CPU Scheduling
- Testrestapi Sample Preview
- Greedy Method
- SL-500-EE5
- Forensics
- All the Mathematics You Missed
- Advanced Encryption Advanced Encryption
- Basic Concepts in Computer Hardware and Software
- Aithmetic Conversions
- 501 Geometry Questions.pdf
- Aritificial Intelligence Cheat Sheet Cheat Sheet
- Exercise 2
- Exercise 4
- Chapter 1
- chapter1.pdf
- L12
- L02_Stack
- Live MS.pdf
- 50 Math, Logic and Word Puzzles - Volume 1[EPUB][GLODLS]

You are on page 1of 1

Lent 2004

Suggested Exercises 3

ministic Turing machine M and a polynomial p such that M halts in time

p(n) for all inputs of length x, and L is exactly the set of strings x such

that all computations of M on input x end in an accepting state.

putation has three possible outcomes: accept, reject or maybe. If M is such

a machine, we say that it accepts L, if for every x ∈ L, every computation

path of M on x ends in either accept or maybe, with at least one accept

and for x 6∈ L, every computation path of M on x ends in reject or maybe,

with at least one reject.

Show that if L is decided by a strong nondeterministic Turing machine

running in polynomial time, then L ∈ NP ∩ co-NP.

Reachability is in SPACE((log n)2 ). What is the time complexity of this

algorithm?

Can you generalise the time bound to the entire complexity class? That is,

give a class of functions F , such that

[

SPACE((log n)2 ) ⊆ TIME(f )

f ∈F

4. Show that, for every nondeterministic machine M which uses O(log n) work

space, there is a machine R with three tapes (input, work and output)

which works as follows. On input x, R produces on its output tape a

description of the configuration graph for M, x, and R uses O(log |x|) space

on its work tape.

Explain why this means that if Reachability is in L, then L = NL.

IN}. L 6∈ SPACE(c) for any constant c. Why?

- Foundations of MathematicsUploaded byAhmad Alhour
- CPU SchedulingUploaded byAnonymous s3TzBvwS1
- Testrestapi Sample PreviewUploaded byMarwa De Hatoum
- Greedy MethodUploaded byAnonymous s3TzBvwS1
- SL-500-EE5Uploaded byutham143
- ForensicsUploaded byzeeshan17
- All the Mathematics You MissedUploaded byfcsardinha
- Advanced Encryption Advanced EncryptionUploaded byAnonymous s3TzBvwS1
- Basic Concepts in Computer Hardware and SoftwareUploaded byJugal Kishore
- Aithmetic ConversionsUploaded byAnonymous s3TzBvwS1
- 501 Geometry Questions.pdfUploaded byAnonymous s3TzBvwS1
- Aritificial Intelligence Cheat Sheet Cheat SheetUploaded byAnonymous s3TzBvwS1
- Exercise 2Uploaded byAnonymous s3TzBvwS1
- Exercise 4Uploaded byAnonymous s3TzBvwS1
- Chapter 1Uploaded byAnonymous s3TzBvwS1
- chapter1.pdfUploaded byAnonymous s3TzBvwS1
- L12Uploaded byAnonymous s3TzBvwS1
- L02_StackUploaded byAnonymous s3TzBvwS1
- Live MS.pdfUploaded byAnonymous s3TzBvwS1
- 50 Math, Logic and Word Puzzles - Volume 1[EPUB][GLODLS]Uploaded bymanikanta
- 06.1 Collision Resistance IntroductionUploaded byAnonymous s3TzBvwS1
- etting up the Forensic Laboratory - Ch3.pdfUploaded byAnonymous s3TzBvwS1
- Mastering Entity FrameworkUploaded byAnonymous s3TzBvwS1
- C#AsyncPM TutorialUploaded byAnonymous s3TzBvwS1
- Test Case TemplateUploaded byArunesh Kumar Singh
- Advanced Stored ProceduresUploaded byOleksiy Kovyrin
- Sans Sec 660.4 - Exploiting Linux for Penetration TestersUploaded byAnonymous s3TzBvwS1
- Tor_Forensics_On_Windows_OS_Mattia_Epifani.pdfUploaded byAnonymous s3TzBvwS1
- MTA_SSG_NetFund_individual_without_cropUploaded byTorque Muliango