1![Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields Jean-Fran¸cois Biasse∗ Abstract This paper gives polynomial time quantum algorithms for Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields Jean-Fran¸cois Biasse∗ Abstract This paper gives polynomial time quantum algorithms for](https://www.pdfsearch.io/img/501677d7d878f0c621d0ed53b2cecd09.jpg) | Add to Reading ListSource URL: fangsong.infoLanguage: English - Date: 2018-07-17 14:44:28
|
---|
2![DRAFTProject Number: EMCProject Name: Class II-L Effectiveness Monitoring BACKGROUND INFORMATION AND PROBLEM STATEMENT Conflicts in implementing the original Class II-L rules led to passage of the Cal DRAFTProject Number: EMCProject Name: Class II-L Effectiveness Monitoring BACKGROUND INFORMATION AND PROBLEM STATEMENT Conflicts in implementing the original Class II-L rules led to passage of the Cal](https://www.pdfsearch.io/img/4b516f7dcd06b0df61d7ff02ee1d3be0.jpg) | Add to Reading ListSource URL: www.bof.fire.ca.govLanguage: English - Date: 1997-07-26 01:00:00
|
---|
3![WEBER’S CLASS NUMBER PROBLEM TAKASHI FUKUDA AND KEIICHI KOMATSU 1. Introduction Two hundred years ago, Gauss gave the following two conjectures (cf. [2]): Conjecture 1. The imaginary quadratic fields with class number WEBER’S CLASS NUMBER PROBLEM TAKASHI FUKUDA AND KEIICHI KOMATSU 1. Introduction Two hundred years ago, Gauss gave the following two conjectures (cf. [2]): Conjecture 1. The imaginary quadratic fields with class number](https://www.pdfsearch.io/img/67333386193733c4d07cd12a38d05054.jpg) | Add to Reading ListSource URL: staff.miyakyo-u.ac.jp- Date: 2008-10-19 20:20:58
|
---|
4![CONSTRUCTION OF MAXIMAL UNRAMIFIED p-EXTENSIONS WITH PRESCRIBED GALOIS GROUPS MANABU OZAKI (KINKI UNIVERSITY) 1. Introduction For any number field F (not necessary of finite degree) and prime CONSTRUCTION OF MAXIMAL UNRAMIFIED p-EXTENSIONS WITH PRESCRIBED GALOIS GROUPS MANABU OZAKI (KINKI UNIVERSITY) 1. Introduction For any number field F (not necessary of finite degree) and prime](https://www.pdfsearch.io/img/bd4812d92adb4f116ca30716b9f42a1f.jpg) | Add to Reading ListSource URL: staff.miyakyo-u.ac.jpLanguage: English - Date: 2008-10-20 09:16:54
|
---|
5![Numerical treatment of a class of optimal control problems arising in economics Etienne Emmrich† and Horst Schmitt‡ Version April 11, 2005 Abstract The approximate solution of the problem of controlling an initial va Numerical treatment of a class of optimal control problems arising in economics Etienne Emmrich† and Horst Schmitt‡ Version April 11, 2005 Abstract The approximate solution of the problem of controlling an initial va](https://www.pdfsearch.io/img/d39214f86a8e52645aefdad0bd74b8a6.jpg) | Add to Reading ListSource URL: www.math.tu-berlin.deLanguage: English - Date: 2012-02-06 05:31:14
|
---|
6![Syllabus 1. Induction This class will demonstrate the fundamental problem solving technique of mathematical induction. Example Problem: Prove that for every positive integer n there exists an n-digit number divisible by Syllabus 1. Induction This class will demonstrate the fundamental problem solving technique of mathematical induction. Example Problem: Prove that for every positive integer n there exists an n-digit number divisible by](https://www.pdfsearch.io/img/e33aabc2440591b8a619fab9c91b68ae.jpg) | Add to Reading ListSource URL: www.artofproblemsolving.comLanguage: English - Date: 2016-02-02 15:54:20
|
---|
7![Counting Eulerian Circuits is #P-Complete Graham R. Brightwell Abstract We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P. The method employed is mod Counting Eulerian Circuits is #P-Complete Graham R. Brightwell Abstract We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P. The method employed is mod](https://www.pdfsearch.io/img/4368b00dc3f746b5259f9cc632620760.jpg) | Add to Reading ListSource URL: www.siam.orgLanguage: English - Date: 2005-07-06 08:19:12
|
---|
8![Bases Tanya Khovanova November 4, 2013 Class Discussion A static strategy for the Nine-coins problem, ternary numbers. Divisibility in bases: divisibility by n/2, by n − 1, by n + 1. Sum and multiply numbers Bases Tanya Khovanova November 4, 2013 Class Discussion A static strategy for the Nine-coins problem, ternary numbers. Divisibility in bases: divisibility by n/2, by n − 1, by n + 1. Sum and multiply numbers](https://www.pdfsearch.io/img/e81101951f74e6aece2766d67d1a080a.jpg) | Add to Reading ListSource URL: www.tanyakhovanova.comLanguage: English - Date: 2013-12-12 14:16:10
|
---|
9![Invariants 2 Tanya Khovanova April 26, 2010 Class Discussion The variation of 12 coins problem when you need to produce the weighings in Invariants 2 Tanya Khovanova April 26, 2010 Class Discussion The variation of 12 coins problem when you need to produce the weighings in](https://www.pdfsearch.io/img/f2db49f1de656f3357860e277b53a105.jpg) | Add to Reading ListSource URL: www.tanyakhovanova.comLanguage: English - Date: 2010-05-08 18:47:58
|
---|
10![The class number one problem for some non-abelian normal CM-fields of degree 24 Franz Lemmermeyer Bilkent University, Dept. Mathematics[removed]Bilkent, Ankara, Turkey The class number one problem for some non-abelian normal CM-fields of degree 24 Franz Lemmermeyer Bilkent University, Dept. Mathematics[removed]Bilkent, Ankara, Turkey](https://www.pdfsearch.io/img/112d1a84a398c9553f02fa534a2df0dd.jpg) | Add to Reading ListSource URL: www.fen.bilkent.edu.trLanguage: English - Date: 2003-09-11 11:03:48
|
---|