2446 search results - page 152 / 490 » Choiceless Polynomial Time |
141
Voted
CORR
2002
Springer
15 years 19 days ago
2002
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
CP
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
109
Voted
ATMOS
2007
15 years 2 months ago
2007
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
ALT
2010
Springer
15 years 2 months ago
2010
Springer
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability
132
click to vote
ACTA
2007
15 years 29 days ago
2007
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...