Sciweavers

Top Ranked Papers of 2011 on Mathematics | DMTCS

All ConferencesAMCSAMLASMTAISSACCALCOCASCDMTCS Explore DMTCS 2011 »

326

Voted

DMTCS
2011

261views Mathematics» more DMTCS 2011»

An expected polynomial time algorithm for coloring 2-colorable 3-graphs

14 years 7 months ago

An expected polynomial time algorithm for coloring 2-colorable 3-graphs

Download www.math.uni-hamburg.de

Abstract. We present an algorithm that for 2-colorable 3-uniform hypergraphs, ﬁnds a 2-coloring in average running time O(n5 log2 n).

Yury Person, Mathias Schacht

claim paper

Read More »

Applied Computing

Artificial Intelligence

Augmented Reality

Automated Reasoning

Computational Biology

Computational Geometry

Computational Linguistics

Computer Architecture

Computer Graphics

Computer Networks

Computer Vision

Control Systems

Discrete Geometry

Distributed And Parallel Computing

Document Analysis

Electrical And Computer Engineering

Embedded Systems

Emerging Technology

Human Computer Interaction

Image Processing

Information Technology

Intelligent Agents

Internet Technology

Knowledge Management

Logical Reasoning

Machine Learning

Medical Imaging

Modeling And Simulation

Natural Language Processing

Neural Networks

Operating System

Operations Research

Pattern Recognition

Programming Languages

Security Privacy

Sensor Networks

Signal Processing

Social Networks

Social Sciences

Software Engineering

System Software

Theoretical Computer Science

Virtual Reality

Mathematics