146 search results - page 27 / 30 » Connectivity of chamber graphs of buildings and related comp... |
169
click to vote
JCSS
2000
15 years 5 months ago
2000
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...
160
click to vote
AIEDAM
2007
15 years 6 months ago
2007
Because of the increasing complexity of products and the design process, as well as the popularity of computer-aided documentation tools, the number of electronic and textual desi...
164
click to vote
FOCS
2009
IEEE
16 years 25 days ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
164
Voted
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract-- The calculation of network reliability in a probabilistic context has long been an issue of practical and academic importance. Conventional approaches (determination of ...
170
click to vote
SIAMDM
1998
15 years 5 months ago
1998
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...