DocumentCode :
3449644
Title :
40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
fYear :
1999
fDate :
17-19 Oct. 1999
Abstract :
The following topics are dealt with: computational complexity; approximation algorithms; upper and lower bounds; proof systems; load balancing; graph theory; combinatorial algorithms; satisfiability and computability; search problems; optimisation; cryptography theory; facility location; and formal languages
Keywords :
algorithm theory; computability; cryptography; facility location; formal languages; graph theory; optimisation; resource allocation; theorem proving; approximation algorithms; combinatorial algorithms; computability; computational complexity; cryptography theory; facility location; formal languages; graph theory; load balancing; lower bounds; optimisation; proof systems; satisfiability; search problems;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1999. 40th Annual Symposium on
Conference_Location :
New York City, NY, USA
ISSN :
0272-5428
Print_ISBN :
0-7695-0409-4
Type :
conf
DOI :
10.1109/SFFCS.1999.814570
Filename :
814570
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=3449644
بازگشت