Search Result Save to File Save as CSV
Your search for 38392 returns 2461 document(s)
Lower bounds on testing membership to a polyhedron by algebraic decision trees,Hal 635-644
Author: Dima Grigoriev; | Call Number: SEM-202 | Type: Indeks Artikel prosiding/Sem
Find Similar |  Add To Favorites |  Detail in New Window 
Run-time performance optimization of an FPGA-based deduction engine for SAT solvers, (LNCS-Lecture Notes in Computer Science 2147) Hal 315-325
Author: Andreas Dandalis; Viktor K. Prasanna; Bharani Thiruvengadam; | Call Number: 005.115 Fie | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Improving the upper bound on the maximum differential and the maximum linear hull probability for spn structures and aes, (LNCS-Lecture Notes in Computer Science 2887) Hal 247-260
Author: Sangwoo Park; Soo Hak Sung; Sangjin Lee; Jongin Lim; | Call Number: 652.8 Joh f | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Exploiting symmetry when verifying transistor-level circuits by symbolic trajectory evaluation, (LNCS-Lecture Notes in Computer Science 1254) Hal 244-255
Author: Manish Pandey; Randal E. Bryant; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
FPGA-based modelling unit for high speed lossless arithmetic coding, (LNCS-Lecture Notes in Computer Science 2147) Hal 643-647
Author: Riad Stefo; Jose Luis Nunez; Claudia Feregrino; Sudipta Mahapatra; Simon Jones; | Call Number: 005.115 Fie | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
A Multifunctional turbo-based receiver using partial unit memory codes, (LNCS-Lecture Notes in Computer Science 2898), Hal. 24-34
Author: Lina Pagoonee and Bahran Honary; | Call Number: 005.82 Cry | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
A Lower bound theorem for indexing schemes and its application to multidimensional range queries, Hal. 44-51
Author: Vasilis Samoladas, Daniel P. Miranker; | Call Number: SEM-243 | Type: Indeks Artikel prosiding/Sem
Find Similar |  Add To Favorites |  Detail in New Window 
Lower bounds for union-split-find related problems on random access machines,Hal 625-634
Author: Peter Bro Miltersen; | Call Number: SEM-202 | Type: Indeks Artikel prosiding/Sem
Find Similar |  Add To Favorites |  Detail in New Window 
Formal Languages and Complexity Theory: Time-Space Trade-Off Lower Bounds for Randomized Computation of Decision Problems, A Complete Problem for Statistical Zero Knowledge
Author: P. Beame, [et all] | Type: Indeks Artikel Jurnal
Find Similar |  Add To Favorites |  Detail in New Window 
Preference reasoning, (LNCS-Lecture Notes in Computer Science 3709) Hal 9-12
Author: Francesca Rossi; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Prev   1 2 3 4 5 6 7 8 9 10  Next