Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
research
oaioai:publikationen.ub.uni-frankfurt.de:3327

Satisfiability is quasilinear complete in NQL

Authors
Publication date
10 November 2005
Publisher

Abstract

Considered are the classes QL (quasilinear) and NQL (nondet quasllmear) of all those problems that can be solved by deterministic (nondetermlnlsttc, respectively) Turmg machines in time O(n(log n) ~) for some k Effloent algorithms have time bounds of th~s type, it is argued. Many of the "exhausUve search" type problems such as satlsflablhty and colorabdlty are complete in NQL with respect to reductions that take O(n(log n) k) steps This lmphes that QL = NQL iff satisfiabdlty is m QL CR CATEGORIES: 5.2

Similar works

Full text

thumbnail-image

Hochschulschriftenserver - Universität Frankfurt am Main

redirect
oaioai:publikationen.ub.uni-frank...
Last time updated on 27/08/2013

This paper was published in Hochschulschriftenserver - Universität Frankfurt am Main.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.