2446 search results - page 126 / 490 » Choiceless Polynomial Time |
101
Voted
PKC
1999
Springer
15 years 5 months ago
1999
Springer
This paper introduces a method for tracking different copies of functionally equivalent algorithms containing identification marks known to the attacker. Unlike all previous solu...
123
Voted
KI
2007
Springer
15 years 7 months ago
2007
Springer
Axiom pinpointing has been introduced in description logics (DLs) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base t...
113
click to vote
RTSS
2002
IEEE
15 years 5 months ago
2002
IEEE
Feasibility analysis of fixed priority systems has been widely studied in the real-time literature and several acceptance tests have been proposed to guarantee a set of periodic ...
106
Voted
FSTTCS
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We prove several results about the average-case complexity of problems in the Polynomial Hierarchy (PH). We give a connection among average-case, worst-case, and non-unif...
143
click to vote
STOC
1995
ACM
15 years 4 months ago
1995
ACM
Genomes frequently evolve by reversals (i, j) that transform a gene order 1 . . . iiϩ1 . . . jϪ1j . . . n into 1 . . . ijϪ1 . . . iϩ1j . . ....