books search
books
articles search
articles
Donate
Log In
Log In
to access more features
personal recommendations
Telegram Bot
download history
send to Email or Kindle
manage booklists
save to favorites
Explore
Journals
Contribution
Donate
Litera Library
Donate paper books
Add paper books
Open LITERA Point
Volume 25; Issue 3
Main
Theory of Computing Systems
Volume 25; Issue 3
Theory of Computing Systems
Volume 25; Issue 3
1
The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem
Raymond Greenlaw
Journal:
Theory of Computing Systems
Year:
1992
Language:
english
File:
PDF, 814 KB
Your tags:
english, 1992
2
Structural properties for feasibly computable classes of type two
Tomoyuki Yamakami
Journal:
Theory of Computing Systems
Year:
1992
Language:
english
File:
PDF, 1.26 MB
Your tags:
english, 1992
3
A survey of one-way functions in complexity theory
Alan L. Selman
Journal:
Theory of Computing Systems
Year:
1992
Language:
english
File:
PDF, 1.04 MB
Your tags:
english, 1992
4
Structure and importance of logspace-MOD class
Gerhard Buntrock
,
Carsten Damm
,
Ulrich Hertrampf
,
Christoph Meinel
Journal:
Theory of Computing Systems
Year:
1992
Language:
english
File:
PDF, 812 KB
Your tags:
english, 1992
1
Follow
this link
or find "@BotFather" bot on Telegram
2
Send /newbot command
3
Specify a name for your chatbot
4
Choose a username for the bot
5
Copy an entire last message from BotFather and paste it here
×
×
