OP-10043Computational complexityStatus unassessed
Polynomial-time computability of factoring
Polynomial-time computability of factoring
Formal Conjectures· Specialist source · status unassessed
MSC2020 · 68-XX
Computer science
Computer science \{For papers containing software, source code, etc. in a specific mathematical area, see the classification number --04 in that area\}
310 mapped entries · Browse and filter all →
Counts include all statuses and descendants. Classifications are editorial or inferred from community fields, not an AMS assessment of the problem.
Subcategories
68-00General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science068-01Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science068-02Research exposition (monographs, survey articles) pertaining to computer science068-03History of computer science068-04Software, source code, etc. for problems pertaining to computer science068-06Proceedings, conferences, collections, etc. pertaining to computer science068-11Research data for problems pertaining to computer science068MxxComputer system organization4268NxxTheory of software068PxxTheory of data468QxxTheory of computing3968RxxDiscrete mathematics in relation to computer science068TxxArtificial intelligence568UxxComputing methodologies and applications3868VxxComputer science support for mathematical research and practice068WxxAlgorithms in computer science182
Mapped problems
OP-9980Computational complexityStatus unassessed
Černý Conjecture
Černý Conjecture
Formal Conjectures· Specialist source · status unassessed
OP-9955Computational complexityStatus unassessed
Strong Sensitivity Conjecture (`bs(f) ≤ s(f)^2`)
Strong Sensitivity Conjecture ( bs(f) ≤ s(f)^2 )
Formal Conjectures· Specialist source · status unassessed
OP-9762Computational complexityStatus unassessed
Conjectures in Complexity Theory
Conjectures in Complexity Theory
Formal Conjectures· Specialist source · status unassessed
OP-9555Computational geometryStatus unassessed
Zipper unfoldings of convex polyhedra
Can every convex polyhedron be flattened without overlap after cutting along one simple path through all its vertices? This zipper path may traverse face interiors, and is not required to follow the edge graph.
The Open Problems Project (computational geometry)· Research-list selection · status unassessed
OP-9554Computational geometryStatus unassessed
Constructive classification of equiprojective polyhedra
For each k , classify or construct all k -equiprojective polyhedra: polyhedra whose orthogonal projection is a k -gon in every direction not parallel to a face. The source already gives an edge-face-pair…
The Open Problems Project (computational geometry)· Research-list selection · status unassessed
OP-9553Computational geometryStatus unassessed
Coloring geometric complete graphs into noncrossing classes
For a general-position set of n planar points, color every segment joining two points so that properly crossing segments have different colors. Determine the worst-case minimum number of colors as a function of n ;…
The Open Problems Project (computational geometry)· Research-list selection · status unassessed
OP-9552Computational geometryStatus unassessed
Spherical polyhedral surfaces made of regular pentagons
Must every closed polyhedral surface homeomorphic to S^2 , composed of congruent regular pentagons and immersed in mathbb R ^3 , arise as the boundary of a union of solid regular dodecahedra joined along whole faces?
The Open Problems Project (computational geometry)· Research-list selection · status unassessed
OP-9551Computational geometryStatus unassessed
Rolling a die over a fully labeled rectangular board
A rectangular grid board assigns a value from one to six to every cell. Determine the complexity of deciding whether a standard labeled die, from the specified corner and initial orientation, can roll across the board…
The Open Problems Project (computational geometry)· Research-list selection · status unassessed
OP-9550Computational geometryStatus unassessed
Worst-case reflexivity of planar point sets
For a planar point set S in general position, let rho(S) be the minimum number of reflex vertices in a simple polygon using exactly S as its vertices. Determine rho(n)= max |S|=n rho(S) . Is rho(n)= lfloor n/4 rfloor ?
The Open Problems Project (computational geometry)· Research-list selection · status unassessed
Journals & articles in MSC 68
These are selected sources for the parent class. Article coverage is a first reviewed selection, and may not cover this exact subcategory.
Springer Nature
Discrete geometry and geometric computation
SIAM
Theory of computation
SIAM
Applied and computational mathematics reviews
- The complexity of propositional proofs
2007 · 2 questions extracted
- Randomized numerical linear algebra: Foundations and algorithms
2020 · 0 questions extracted
MSC2020 © Mathematical Reviews (AMS) and zbMATH · CC BY-NC-SA 4.0 · Official PDF, page 175