2661 search results - page 165 / 533 » Quantum Complexity Classes |
130
Voted
MFCS
2007
Springer
15 years 9 months ago
2007
Springer
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
119
click to vote
SAT
2004
Springer
15 years 8 months ago
2004
Springer
We study the parameterized complexity of detecting backdoor sets for instances of the propositional satisfiability problem (SAT) with respect to the polynomially solvable classes ...
170
Voted
RANDOM
2001
Springer
15 years 7 months ago
2001
Springer
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨© ¤¥ ¦ §¨ belongs to a certain class of Boolean functions or whether it is far from the...
149
click to vote
BIRTHDAY
2004
Springer
15 years 7 months ago
2004
Springer
A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on the preceding universal variables, such that substi...
125
click to vote
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
At the "functional level", Semantic Web Services (SWS) are described akin to planning operators, with preconditions and effects relative to an ontology; the ontology prov...