<--- Back to Details
First PageDocument Content
Logicians / Yuri Matiyasevich / Symposium on Theoretical Aspects of Computer Science / Lecture Notes in Computer Science / Nearest neighbor search / Obfuscated code / Saint Petersburg State University of Information Technologies /  Mechanics and Optics / Theoretical computer science / Algorithmic Number Theory Symposium / Information science / Mathematics / Science
Date: 2009-12-02 22:11:35
Logicians
Yuri Matiyasevich
Symposium on Theoretical Aspects of Computer Science
Lecture Notes in Computer Science
Nearest neighbor search
Obfuscated code
Saint Petersburg State University of Information Technologies
Mechanics and Optics
Theoretical computer science
Algorithmic Number Theory Symposium
Information science
Mathematics
Science

December[removed]Yury Lifshits

Add to Reading List

Source URL: yury.name

Download Document from Source Website

File Size: 122,41 KB

Share Document on Facebook

Similar Documents

Symposium on Theoretical Aspects of Computer ScienceBordeaux), ppwww.stacs-conf.org LOWER BOUNDS FOR ADAPTIVE LINEARITY TESTS SHACHAR LOVETT Faculty of Mathematics and Computer Science

DocID: 1uGnw - View Document

Symposium on Theoretical Aspects of Computer ScienceBordeaux), ppwww.stacs-conf.org ON THE COMPLEXITY OF ELEMENTARY MODAL LOGICS EDITH HEMASPAANDRA AND HENNING SCHNOOR Department of Computer Science, Roc

DocID: 1u1fW - View Document

34th International Symposium on Theoretical Aspects of Computer Science Program and Information Conference Information

DocID: 1tROy - View Document

30th Symposium on Theoretical Aspects of Computer Science (STACS 2014), STACS 2014, Lyon (France), March 5-8, 2014. Explicit linear kernels via dynamic programming? ??

DocID: 1sQW9 - View Document

Submitted to the Symposium on Theoretical Aspects of Computer Science www.stacs-conf.org ON SUM COLORING AND SUM MULTI-COLORING FOR RESTRICTED FAMILIES OF GRAPHS ALLAN BORODIN 1 AND IOANA IVAN 1 AND YULI YE 1 AND BRYCE Z

DocID: 1leiP - View Document