2446 search results - page 149 / 490 » Choiceless Polynomial Time |
126
click to vote
FSTTCS
2008
Springer
15 years 5 months ago
2008
Springer
Tight connections between leafs languages and strings compressed via straight-line programs (SLPs) are established. It is shown that the compressed membership problem for a languag...
123
click to vote
DISOPT
2008
15 years 4 months ago
2008
In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed n-fold integer programming problems are polynomial time ...
140
click to vote
CPC
2006
15 years 4 months ago
2006
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...
117
click to vote
CSL
2002
Springer
15 years 4 months ago
2002
Springer
A propositional proof system is automatizable if there is an algorithm that, given a tautology, produces a proof in time polynomial in the size of its smallest proof. This notion ...
147
click to vote
TCBB
2010
15 years 2 months ago
2010
— We describe a theoretical unifying framework to express comparison of RNA structures, which we call alignment hierarchy. This framework relies on the definition of common supe...