نتائج البحث

Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry

• Authors : Bringmann, Karl

Subjects: Computer Science - Computational Geometry; Computer Science - Data Structures and Algorithms

تفاصيل العنوان

On The Utility of Fine-Grained Complexity Theory

• Authors : Sabin, Manuel

Subjects: Computer science; Theoretical mathematics; Mathematics

تفاصيل العنوان

Fine-Grained Complexity Theory (Tutorial)

• Authors : Bringmann, Karl

Subjects: Hardness in P, conditional lower bound, fine-grained reduction; Data processing Computer science; InProceedings

تفاصيل العنوان

Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Linear Integer Arithmetic ...

• Authors : Gokaj, Geri; Künnemann, Marvin

Subjects: fine-grained complexity theory; descriptive complexity; presburger arithmetic

تفاصيل العنوان

Fine-Grained Complexity of Multiple Domination and Dominating Patterns in Sparse Graphs

• Authors : Künnemann, Marvin; Redzic, Mirza

Subjects: Fine-grained complexity theory; Dominating set; Sparsity in graphs

• Source: ISSN: 1868-8969.

تفاصيل العنوان

Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry

• Authors : Karl Bringmann

Subjects: Discrete mathematics; Computational Geometry (cs.CG); FOS: Computer and information sciences

• Source: Lecture Notes in Computer Science ISBN: 9783030800482Lecture Notes in Computer ScienceLecture Notes in Computer Science-Connecting with ComputabilityConnecting with

تفاصيل العنوان

Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry

• Authors : Bringmann, K.

تفاصيل العنوان

The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds

• Authors : Bringmann, Karl; Grønlund, Allan; Künnemann, Marvin ...

Subjects: Fine-grained complexity theory; non-deterministic finite automata

تفاصيل العنوان

Combinatorial Designs Meet Hypercliques: Higher Lower Bounds for Klee’s Measure Problem and Related Problems in Dimensions d ≥ 4

• Authors : Gorbachev, Egor; Künnemann, Marvin; Egor Gorbachev and Marvin Künnemann

Subjects: Fine-grained complexity theory; non-combinatorial lower bounds; computational geometry

تفاصيل العنوان

A Structural Investigation of the Approximability of Polynomial-Time Problems ...

• Authors : Bringmann, Karl; Cassis, Alejandro; Fischer, Nick

Subjects: Classification Theorems; Hardness of Approximation in P; Fine-grained Complexity Theory

تفاصيل العنوان