Skip to search formSkip to main contentSkip to account menu

LOGCFL

In computational complexity theory, LOGCFL is the complexity class that contains all decision problems that can be reduced in logarithmic space to a… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In this work we study the problem of efficiently isolating witnesses for the complexity classes NL and LogCFL, which are two well… 
2015
2015
Alekhnovich and Razborov (2002) presented an algorithm that solves SAT on instances φ of size n and tree-width TW(φ), using time… 
2015
2015
Introduction The OWL 2 QL ontology language [11], based upon the description logic DL-LiteR, is considered particularly well… 
2007
2007
The P-complete Circuit Value Problem CVP, when restricted to monotone planar circuits MPCVP, is known to be in NC, and for the… 
1999
1999
Yonatan Aumann, Johan Hastad, Michael O. Rabin, and Madhu Sudan. Linear Consistency Testing Juraj Hromkovic and Sebastian Seibert… 
1994
1994
With the recent advance in hardware technology of very large-scale integration and parallel computer architecture, vector and…