Sciweavers

13 search results - page 1 / 3
» On Some SAT-Variants over Linear Formulas
Sort
View
SOFSEM
2009
Springer
14 years 1 months ago
On Some SAT-Variants over Linear Formulas
Informationen zum TheorieTag und Abstracts zu den Beitr¨agen finden Sie unter http://www.uni-ulm.de/in/theo/tt56.html.
Stefan Porschen, Tatjana Schmidt
STOC
2003
ACM
102views Algorithms» more  STOC 2003»
14 years 5 months ago
Some 3CNF properties are hard to test
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodniko...
MKM
2009
Springer
13 years 11 months ago
A Linear Grammar Approach to Mathematical Formula Recognition from PDF
Many approaches have been proposed over the years for the recognition of mathematical formulae from scanned documents. More recently a need has arisen to recognise formulae from PD...
Josef B. Baker, Alan P. Sexton, Volker Sorge
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 4 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
ICIP
1998
IEEE
14 years 6 months ago
An Explicit Closed-Form Solution to the Limited-Angle Discrete Tomography Problem for Finite-Support Objects
: An explicit formula is presented for reconstructing a This article derives an explicit formula for the integer values finite-support object defined on a lattice of points and tak...
Andrew E. Yagle