dissection bkw
play

Dissection-BKW CRYPTO 2018, Santa Barbara , August 20th 2018 Andre - PowerPoint PPT Presentation

Jul 28, 2023 •934 likes •1.86k views

Dissection-BKW CRYPTO 2018, Santa Barbara , August 20th 2018 Andre Esser , Felix Heuer, Robert Kbler, Alexander May, Christian Sohler Horst Grtz Institute for IT Security Ruhr University Bochum What is LPN? Learning Parity with Noise (LPN)

  1. Dissection-BKW CRYPTO 2018, Santa Barbara , August 20th 2018 Andre Esser , Felix Heuer, Robert Kübler, Alexander May, Christian Sohler Horst Görtz Institute for IT Security Ruhr University Bochum

  2. What is LPN? Learning Parity with Noise (LPN) Problem $ ← F k 2 , Pr [ e i = 1] = τ < 1 Given: ( a i , � a i , s � + e i ) , a i 2 Find: s ∈ F k 2 Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 2/13

  3. What is LPN? Learning Parity with Noise (LPN) Problem $ ← F k 2 , Pr [ e i = 1] = τ < 1 Given: ( a i , � a i , s � + e i ) , a i 2 Find: s ∈ F k 2 • Cryptographic applications [HB01, Ale03, HKL + 12, DV13] Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 2/13

  4. What is LPN? Learning Parity with Noise (LPN) Problem $ ← F k 2 , Pr [ e i = 1] = τ < 1 Given: ( a i , � a i , s � + e i ) , a i 2 Find: s ∈ F k 2 • Cryptographic applications [HB01, Ale03, HKL + 12, DV13] • Solve LPN: BKW algorithm [BKW00] ◦ Time = Memory = Samples , slightly subexponential ◦ only small experiments [BTV16, EKM17] Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 2/13

  5. What is LPN? Learning Parity with Noise (LPN) Problem $ ← F k 2 , Pr [ e i = 1] = τ < 1 Given: ( a i , � a i , s � + e i ) , a i 2 Find: s ∈ F k 2 • Cryptographic applications [HB01, Ale03, HKL + 12, DV13] • Solve LPN: BKW algorithm [BKW00] ◦ Time = Memory = Samples , slightly subexponential ◦ only small experiments [BTV16, EKM17] • Goal: BKW-variant applicable for any given memory Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 2/13

  6. Illustration of “BKW” ( a 1 , � a 1 , s � + e 1 ) ( a 2 , � a 2 , s � + e 2 ) Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 3/13

  7. Illustration of “BKW” ( a 1 , � a 1 , s � + e 1 ) + ( a 2 , � a 2 , s � + e 2 ) = ( a 1 + a 2 , � a 1 + a 2 , s � + e 1 + e 2 ) a ′ � a ′ , s � e ′ ( , + ) Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 3/13

  8. Illustration of “BKW” $ Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 3/13

  9. Illustration of “BKW” $ Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 3/13

  10. Illustration of “BKW” $ 0101 0101 $ stripe Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 3/13

  11. Illustration of “BKW” 0000 $ $ 0101 + 0101 $ stripe Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 3/13

  12. Illustration of “BKW” 0000 $ $ 0101 1111 $ 0101 $ $ 1111 Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 3/13

  13. Illustration of “BKW” 0000 $ $ 0101 $ 0000 1111 $ + 0101 $ $ 1111 Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 3/13

  14. Illustration of “BKW” 0000 $ $ 0101 $ 0000 $ 0000 1111 $ 0101 $ $ 1111 Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 3/13

  15. Illustration of “BKW” 0000 $ $ 0101 $ 0000 $ 0000 1111 0000 $ $ 0101 $ $ 1111 Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 3/13

  16. Illustration of “BKW” 0000 $ $ 0101 $ 0000 $ 0000 1111 0000 $ $ 0101 $ . . . . . . . . . $ 1111 0000 $ Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 3/13

  17. Illustration of “BKW” $ $ $ $ . . . . . . . . . $ Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 3/13

  18. Illustration of “BKW” $ $ $ $ $ $ $ $ → . . . . . . . . . . . . . . . . . . $ $ Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 3/13

  19. Illustration of “BKW” 1 $ $ $ $ 1 $ $ 1 1 $ $ → → . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 $ $ Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 3/13

  20. Illustration of “BKW” 1 $ $ $ $ 1 $ $ 1 1 $ $ → → . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 $ $ • a i = (1 , 0 , 0 , . . . , 0) ⇒ ( a i , � a i , s � + e i ) = ( a i , s 1 + e i ) • Majority vote! BKW Theorem [BKW00, LF06] BKW solves LPN in time, memory and sample complexity 2 k/ log k . Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 3/13

  21. c -sum Observation $ 0000 0101 $ + $ 0101 Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 4/13

  22. c -sum Observation $ 0000 0101 $ + $ 0000 $ 0101 Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 4/13

  23. c -sum Observation $ 0000 0101 $ + $ 0000 number of c -sums increases exponentially in c $ 0101 ⇒ much smaller list (save Memory & Samples) Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 4/13

  24. c -sum Observation $ 0000 0101 $ + $ 0000 number of c -sums increases exponentially in c $ 0101 ⇒ much smaller list (save Memory & Samples) c -sum-Problem ( c - SP ) Given a list L of N uniformly distributed elements from F b 2 . Find N combinations of c elements from L that each add up to 0 b . Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 4/13

  25. c -sum Observation $ 0000 0101 $ + $ 0000 number of c -sums increases exponentially in c $ 0101 ⇒ much smaller list (save Memory & Samples) ! � N � / 2 b ≥ N c c -sum-Problem ( c - SP ) Given a list L of N uniformly distributed elements from F b 2 . Find N combinations of c elements from L that each add up to 0 b . Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 4/13

  26. c -sum Observation $ 0000 0101 $ + $ 0000 number of c -sums increases exponentially in c $ 0101 ⇒ much smaller list (save Memory & Samples) N ≥ 2 b/ ( c − 1) c -sum-Problem ( c - SP ) Given a list L of N uniformly distributed elements from F b 2 . Find N combinations of c elements from L that each add up to 0 b . Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 4/13

  27. c -sum Observation $ 0000 0101 $ + $ 0000 number of c -sums increases exponentially in c $ 0101 ⇒ much smaller list (save Memory & Samples) N = 2 b/ ( c − 1) c -sum-Problem ( c - SP ) Given a list L of N uniformly distributed elements from F b 2 . Find N combinations of c elements from L that each add up to 0 b . Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 4/13

  28. c -sum Observation $ 0000 0101 $ + $ 0000 number of c -sums increases exponentially in c $ 0101 ⇒ much smaller list (save Memory & Samples) N = 2 b/ ( c − 1) Main Idea: solve c - SP repeatedly on stripes c -sum-Problem ( c - SP ) Given a list L of N uniformly distributed elements from F b 2 . Find N combinations of c elements from L that each add up to 0 b . Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 4/13

  29. ■t❡r❛t✐♦♥s ■t❡r❛t✐♦♥s Not just a memory reduction technique $ 0101 $ + $ 0101 Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 5/13

  30. ■t❡r❛t✐♦♥s ■t❡r❛t✐♦♥s Not just a memory reduction technique $ 0101 $ + $ 0101 → → → $ $ $ 1 Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 5/13

  31. ■t❡r❛t✐♦♥s Not just a memory reduction technique $ 0101 $ + $ 0101 sum of A = 2 # ■t❡r❛t✐♦♥s samples → → → $ $ $ 1 Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 5/13

  32. ■t❡r❛t✐♦♥s Not just a memory reduction technique $ 0101 $ + $ 0000 $ 0101 sum of A = 2 # ■t❡r❛t✐♦♥s samples → → → $ $ $ 1 Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 5/13

  33. ■t❡r❛t✐♦♥s Not just a memory reduction technique $ 0101 $ + $ 0000 $ 0101 sum of A = 2 # ■t❡r❛t✐♦♥s samples → → → $ $ $ 1 Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 5/13

  34. ■t❡r❛t✐♦♥s Not just a memory reduction technique $ 0101 $ + $ 0000 $ 0101 sum of B = 3 # ■t❡r❛t✐♦♥s samples → → → $ $ $ 1 Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 5/13

  35. ■t❡r❛t✐♦♥s Not just a memory reduction technique $ 1010101 $ + $ 1110000 $ 0100101 sum of B = 3 # ■t❡r❛t✐♦♥s samples → → → $ $ $ 1 Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 5/13

  36. ■t❡r❛t✐♦♥s ■t❡r❛t✐♦♥s Not just a memory reduction technique $ 1010101 $ + $ 1110000 $ 0100101 → → $ $ 1 Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 5/13

  37. ■t❡r❛t✐♦♥s ■t❡r❛t✐♦♥s Not just a memory reduction technique $ 1010101 $ + $ 1110000 $ 0100101 sum of A samples → → $ $ 1 Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 5/13

  38. ■t❡r❛t✐♦♥s ■t❡r❛t✐♦♥s Not just a memory reduction technique $ 1010101 $ + $ 1110000 $ 0100101 sum of A samples → → $ $ 1 Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 5/13

  39. ❛♥❞ → → $ $ 1 Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 6/13

  40. ❛♥❞ → → N $ $ 1 Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 6/13

  41. ❛♥❞ → → N $ $ 1 solve c - SP Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 6/13

  42. ❛♥❞ → → N $ $ 1 solve c - SP Memory Dissection-BKW|CRYPTO 2018, Santa Barbara|August 20th 2018 6/13

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Part II: Cow Eye Dissection Dissection of a Cow s Eye After the front of the eye has been

Part II: Cow Eye Dissection Dissection of a Cow s Eye After the front of the eye has been

Part II: Cow Eye Dissection Dissection of a Cow s Eye After the front of the eye has been removed from the back, the internal parts can be seen. This view of the back of the eyeball, seen from inside, shows the retina as a translucent

95 views • 5 slides
Chronic Aortic Dissection Treatment of Chronic Aortic Dissection Is Evolving 40% of repairs of

Chronic Aortic Dissection Treatment of Chronic Aortic Dissection Is Evolving 40% of repairs of

4/16/2015 Chronic Aortic Dissection Treatment of Chronic Aortic Dissection Is Evolving 40% of repairs of the descending thoracic aorta have chronic dissection Chronic Aortic Dissection Previous Ascending Repairs performed in 41% New

180 views • 4 slides
Type B Dissection Sub-Categories Acute Complicated Rupture Malperfusion Title

Type B Dissection Sub-Categories Acute Complicated Rupture Malperfusion Title

Disclosure Nothing to disclose Type B Dissection On Whom to Operate on and When to do it Charles Eichler Professor, Department of Surgery Division of Vascular and Endovascular Surgery University of California San Francisco 4/14/2016 2 TBAD

277 views • 6 slides
Side-Channel Countermeasures Dissection and the Limits of Closed Source Security Evaluations

Side-Channel Countermeasures Dissection and the Limits of Closed Source Security Evaluations

Introduction Countermeasures Dissection Information Extraction Attack Results Closed Source Evaluation Conclusion Side-Channel Countermeasures Dissection and the Limits of Closed Source Security Evaluations Olivier Bronchain Fran

2.22k views • 189 slides
1 A RANDOMIZED TRIAL COMPARING RADICAL HYSTERECTOMY AND PELVIC NODE DISSECTION VS SIMPLE

1 A RANDOMIZED TRIAL COMPARING RADICAL HYSTERECTOMY AND PELVIC NODE DISSECTION VS SIMPLE

1 A RANDOMIZED TRIAL COMPARING RADICAL HYSTERECTOMY AND PELVIC NODE DISSECTION VS SIMPLE HYSTERECTOMY AND PELVIC NODE DISSECTION IN PATIENTS WITH LOW-RISK, EARLY- STAGE CERVICAL CANCER A Gynecologic Cancer Intergroup (GCIG) Trial led by the

430 views • 15 slides
VS SIMPLE HYSTERECTOMY AND PELVIC NODE DISSECTION IN PATIENTS WITH LOW-RISK, EARLY- STAGE

VS SIMPLE HYSTERECTOMY AND PELVIC NODE DISSECTION IN PATIENTS WITH LOW-RISK, EARLY- STAGE

A RANDOMIZED TRIAL COMPARING RADICAL HYSTERECTOMY AND PELVIC NODE DISSECTION VS SIMPLE HYSTERECTOMY AND PELVIC NODE DISSECTION IN PATIENTS WITH LOW-RISK, EARLY- STAGE CERVICAL CANCER A Gynecologic Cancer Intergroup (GCIG) Trial led by the CCTG

410 views • 3 slides
VS SIMPLE HYSTERECTOMY AND PELVIC NODE DISSECTION IN PATIENTS WITH LOW-RISK, EARLY- STAGE

VS SIMPLE HYSTERECTOMY AND PELVIC NODE DISSECTION IN PATIENTS WITH LOW-RISK, EARLY- STAGE

A RANDOMIZED TRIAL COMPARING RADICAL HYSTERECTOMY AND PELVIC NODE DISSECTION VS SIMPLE HYSTERECTOMY AND PELVIC NODE DISSECTION IN PATIENTS WITH LOW-RISK, EARLY- STAGE CERVICAL CANCER A Gynecologic Cancer Intergroup (GCIG) Trial led by the CCTG

477 views • 5 slides
GAN Dissection: Visualizing and Understanding Generative Adversarial Networks David Bau, Jun-Yan

GAN Dissection: Visualizing and Understanding Generative Adversarial Networks David Bau, Jun-Yan

GAN Dissection: Visualizing and Understanding Generative Adversarial Networks David Bau, Jun-Yan Zhu, Hendrik Strobelt, Bolei Zhou, Joshua B. Tenenbaum, William T. Freeman, Antonio Torralba Ing. Jakub Zitn y Faculty of Information

391 views • 21 slides
Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and

Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and

Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems Itai Dinur 1 , Orr Dunkelman 1,2 , Nathan Keller 3 and Adi Shamir 1 1 Computer Science department, The Weizmann Institute,

345 views • 33 slides
Unusual presentation of tension pneumoperitoneum during endo- scopic submucosal dissection of

Unusual presentation of tension pneumoperitoneum during endo- scopic submucosal dissection of

Crit Care Shock (2019) 22:72-75 Images in clinical medicine Unusual presentation of tension pneumoperitoneum during endo- scopic submucosal dissection of early gastric tumor Phui Sze Au Yong, Gek Kim Sharon Ong Introduction aesthesia was

315 views • 4 slides
and Outcomes in Patients With Uncomplicated Type B Aortic Dissection Matthew Aizpuru BA 1 ,

and Outcomes in Patients With Uncomplicated Type B Aortic Dissection Matthew Aizpuru BA 1 ,

Racial Differences In Patterns of Presentation and Outcomes in Patients With Uncomplicated Type B Aortic Dissection Matthew Aizpuru BA 1 , Xiaoying Lou MD 2 , Jaime Benarroch-Gampel MD 1 , William D Jordan Jr. MD 1 , Bradley G Leshnower MD 2 ,

879 views • 29 slides
Network Dissection: Quantifying Interpretability of Deep Visual Representations By David Bau,

Network Dissection: Quantifying Interpretability of Deep Visual Representations By David Bau,

Network Dissection: Quantifying Interpretability of Deep Visual Representations By David Bau, Bolei Zhou, Aditya Khosla, Aude Oliva, Antonio Torralba CS 381V Thomas Crosley and Wonjoon Goo Detectors Credit: slide from the original paper Unit

1.39k views • 39 slides
Artery Dissection Diagnosis and Treatment in an Era of Uncertainty James C. Iannuzzi MD, MPH,

Artery Dissection Diagnosis and Treatment in an Era of Uncertainty James C. Iannuzzi MD, MPH,

4/4/2019 Spontaneous Visceral Artery Dissection Diagnosis and Treatment in an Era of Uncertainty James C. Iannuzzi MD, MPH, RPVI Assistant Professor of Surgery Division of Endovascular and Vascular Surgery Department of Surgery University of

502 views • 29 slides
Canadian Spontaneous Coronary Artery Dissection Cohort Study Jacqueline Saw, MD, Andrew

Canadian Spontaneous Coronary Artery Dissection Cohort Study Jacqueline Saw, MD, Andrew

Canadian Spontaneous Coronary Artery Dissection Cohort Study Jacqueline Saw, MD, Andrew Starovoytov, MD, Karin Humphries, DSc, Tej Sheth, MD, Derek So, MD, Kunal Minhas, MD, Neil Brass, MD, Andrea Lavoie, MD, Helen Bishop, MD, Shahar Lavi, MD,

246 views • 23 slides
Lab #5 4-Cylinder Single Overhead Cam Engine Dissection Equipment: 4-Cylinder Mazda 16 Valve

Lab #5 4-Cylinder Single Overhead Cam Engine Dissection Equipment: 4-Cylinder Mazda 16 Valve

Engr 3 Mission College Faculty: Kate Disney TA: Andrew Dina Lab #5 4-Cylinder Single Overhead Cam Engine Dissection Equipment: 4-Cylinder Mazda 16 Valve SOHC 92 (Manual Transmission) Ratchet with 2 and 12 extensions 17 mm socket

456 views • 20 slides
Acute Aortic Dissection: Lessons Learned from 9000 Patients Kim A. Eagle, M.D. On Behalf of the

Acute Aortic Dissection: Lessons Learned from 9000 Patients Kim A. Eagle, M.D. On Behalf of the

Acute Aortic Dissection: Lessons Learned from 9000 Patients Kim A. Eagle, M.D. On Behalf of the IRAD Investigators Kim A. Eagle, Christoph A. Nienaber, Santi Trimarchi, Himanshu J. Patel, Thomas G. Gleason, Daniel G. Montgomery, Reed E.

238 views • 21 slides
Weighted walks around dissected polygons Conway-Coxeter friezes and beyond Christine

Weighted walks around dissected polygons Conway-Coxeter friezes and beyond Christine

Weighted walks around dissected polygons Conway-Coxeter friezes and beyond Christine Bessenrodt MIT, June 27, 2014 Weighted walks around dissected polygons Conway-Coxeter friezes and beyond Christine Bessenrodt 1 1 1 0 2 1 0 0

452 views • 43 slides
Publicly Available Large Data Sets for Health Outcomes Research: Pearls, Pitfalls, Prices &amp;

Publicly Available Large Data Sets for Health Outcomes Research: Pearls, Pitfalls, Prices &amp;

Publicly Available Large Data Sets for Health Outcomes Research: Pearls, Pitfalls, Prices &amp; More LAKSH IKA TEN N AKOON - MD , MS C , MP H IL , D TM&amp;H R ESEAR C H SC IEN TIST TR AU MA, AC U TE C AR E AN D C R ITIC AL C AR E SU R GERY

601 views • 44 slides
Contextual Token Representations ULMfit, OpenAI GPT, ELMo, BERT, XLM Noe Casas Background:

Contextual Token Representations ULMfit, OpenAI GPT, ELMo, BERT, XLM Noe Casas Background:

Contextual Token Representations ULMfit, OpenAI GPT, ELMo, BERT, XLM Noe Casas Background: Language Modeling T 1 T 2 &lt;/s&gt; Data: Monolingual Corpus softmax softmax softmax project. project. project. Task:

981 views • 19 slides
Lean Process Improvement in Healthcare: Barriers and Opportunities Edward G. Anderson Jr., Ph.D.

Lean Process Improvement in Healthcare: Barriers and Opportunities Edward G. Anderson Jr., Ph.D.

Lean Process Improvement in Healthcare: Barriers and Opportunities Edward G. Anderson Jr., Ph.D. Neal Wendt, M.S., M.A. Anderson &amp; Wendt Introductions Edward G. Anderson Jr., Neal Wendt, M.S, M.A.: Ph.D. : Fellow of the Lean

711 views • 22 slides
Learning Where to Sample in Structured Prediction Tianlin Shi Jacob Steinhardt Percy Liang

Learning Where to Sample in Structured Prediction Tianlin Shi Jacob Steinhardt Percy Liang

Learning Where to Sample in Structured Prediction Tianlin Shi Jacob Steinhardt Percy Liang AISTATS 2015 Tianlin S., J. Steinhardt, P. Liang () HeteroSampler AISTATS 2015 1 / 25 Introduction Outline Introduction Reinforcement Learning

1.1k views • 109 slides
Bivalve Anatomy &amp; Classification Class Bivalvia ~15,000 species; includes clams, scallops,

Bivalve Anatomy &amp; Classification Class Bivalvia ~15,000 species; includes clams, scallops,

Bivalve Anatomy &amp; Classification Class Bivalvia ~15,000 species; includes clams, scallops, mussels, oysters 2-valved (hinged) shells w/ adductor muscles Body laterally flattened Lack of cephalization Spaceous mantle cavity

274 views • 13 slides
Scaling limits of random dissections Igor Kortchemski (work with N. Curien and B. Haas) DMA

Scaling limits of random dissections Igor Kortchemski (work with N. Curien and B. Haas) DMA

Scaling limits of random dissections Igor Kortchemski (work with N. Curien and B. Haas) DMA cole Normale Suprieure SIAM Discrete Mathematics - June 2014 Motivation Definition: Boltzmann dissections Theorem Applications Proof Outline

879 views • 85 slides
Heuristics for Nested Dissection to Reduce Fill-in in Sparse Matrix Factorizations Miguel

Heuristics for Nested Dissection to Reduce Fill-in in Sparse Matrix Factorizations Miguel

Heuristics for Nested Dissection to Reduce Fill-in in Sparse Matrix Factorizations Miguel Vargas-Flix, Salvador Botello-Rionda miguelvargas@cimat.mx, botello@cimat.mx Morelia, November 6, 2013 1/28 Sparse matrices In most problems of finite

646 views • 28 slides

More recommend