3946 search results - page 125 / 790 » The computational complexity of choice sets |
171
click to vote
LOGCOM
2010
15 years 5 months ago
2010
All promiment examples of first-order predicate fuzzy logics are undecidable. This leads to the problem of the arithmetical complexity of their sets of tautologies and satisfiab...
178
click to vote
ICALP
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
180
click to vote
GD
2004
Springer
15 years 12 months ago
2004
Springer
This paper discusses a new method for visualisation of large and complex networks in three dimensions. In particular, we focus on visualising the core tree structure of the large a...
169
click to vote
STOC
1993
ACM
15 years 10 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
173
click to vote
SG
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We present a method to generate glyphs which convey complex information in graphical form. A glyph has a linear geometry which is specified using geometric operations, e...