Class number problem

Results: 23



#Item
1Efficient 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

Add to Reading List

Source URL: fangsong.info

Language: English - Date: 2018-07-17 14:44:28
    2DRAFTProject 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

    Add to Reading List

    Source URL: www.bof.fire.ca.gov

    Language: English - Date: 1997-07-26 01:00:00
      3WEBER’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

      Add to Reading List

      Source URL: staff.miyakyo-u.ac.jp

      - Date: 2008-10-19 20:20:58
        4CONSTRUCTION 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

        Add to Reading List

        Source URL: staff.miyakyo-u.ac.jp

        Language: English - Date: 2008-10-20 09:16:54
        5Numerical 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

        Add to Reading List

        Source URL: www.math.tu-berlin.de

        Language: English - Date: 2012-02-06 05:31:14
        6Syllabus 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

        Add to Reading List

        Source URL: www.artofproblemsolving.com

        Language: English - Date: 2016-02-02 15:54:20
          7Counting 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

          Add to Reading List

          Source URL: www.siam.org

          Language: English - Date: 2005-07-06 08:19:12
          8Bases 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

          Add to Reading List

          Source URL: www.tanyakhovanova.com

          Language: English - Date: 2013-12-12 14:16:10
          9Invariants 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

          Add to Reading List

          Source URL: www.tanyakhovanova.com

          Language: English - Date: 2010-05-08 18:47:58
          10The 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

          Add to Reading List

          Source URL: www.fen.bilkent.edu.tr

          Language: English - Date: 2003-09-11 11:03:48