Filters








97 Hits in 6.1 sec

Tighter Connections Between Formula-SAT and Shaving Logs [article]

Amir Abboud, Karl Bringmann
2018 arXiv   pre-print
The authors blame the hardness of shaving logs on the hardness of solving satisfiability on Boolean formulas (Formula-SAT) faster than exhaustive search.  ...  In this paper, we push this approach to its limit and, in particular, prove that a well-known barrier from complexity theory stands in the way for shaving five additional log factors for fundamental combinatorial  ...  We also thank an anonymous reviewer for ideas leading to shaving off a second log-factor for Formula-Pair, and other reviewers for helpful suggestions.  ... 
arXiv:1804.08978v1 fatcat:l3uep5dsafbapg7eq43gbawrsy

Tighter Connections Between Formula-SAT and Shaving Logs

Amir Abboud, Karl Bringmann, Michael Wagner
2018 International Colloquium on Automata, Languages and Programming  
The authors blame the hardness of shaving logs on the hardness of solving satisfiability on boolean formulas (Formula-SAT) faster than exhaustive search.  ...  For LCS, regular expression pattern matching, as well as the Fréchet distance problem from Computational Geometry, we show that an O(n 2 / log 7+ε n) runtime would imply new Formula-SAT algorithms.  ...  We also thank Mohan Paturi, Rahul Santhanam, Srikanth Srinivasan, and Ryan Williams for answering our questions about the state of the art of Formula-SAT algorithms, and Arturs Backurs, Piotr Indyk, Mikkel  ... 
doi:10.4230/lipics.icalp.2018.8 dblp:conf/icalp/AbboudB18 fatcat:osoa7ftd5zes5pnmp6p54trkvi

Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree Isomorphism [article]

Daniel Gibney, Gary Hoppenworth, Sharma V. Thankachan
2020 arXiv   pre-print
Reductions from Formula-SAT have two advantages over the usual reductions from CNF-SAT: (1) conjectures on the hardness of Formula-SAT are arguably much more plausible than those of CNF-SAT, and (2) these  ...  (Formula-SAT).  ...  Aside from a plausible increase in the robustness of the conjectures, using Formula-SAT as a starting point has the advantage of allowing for tighter hardness results.  ... 
arXiv:2008.11786v1 fatcat:7kh7owrmoratxmksazin37enfy

Page 7 of Michigan Farmer Vol. 18, Issue 49 [page]

1887 Michigan Farmer  
use an old valuable discovery for Catarr} ** Log Cabin Rose Cream.”? Among the is also a ‘‘ Log Cabin Plaster,” and ** Log Cabin Liver Pill.”  ...  I had no food, and no chance of get- Around me stretched that broken, marshy country, alternating between pine barrens and swampy bottoms.  ... 

Planning and drawing complex shapes

Martha Flanders, Leigh A. Mrotek, C.C.A.M. Gielen
2005 Experimental Brain Research  
Arm and hand movements are generally controlled using a combination of sensory-based and memory-based guidance mechanisms.  ...  This study examined similarities and differences in visually-guided and memory-guided arm movements, and sought to determine to what extent certain control principles apply to each type of movement.  ...  Routine tasks such as shaving, applying lipstick, and stroking a dog, involve a similar hybrid of sensory and internal guidance.  ... 
doi:10.1007/s00221-005-0252-2 pmid:16308691 fatcat:gxl32geebfcvlhi3466xgv4ybe

Efficient Probabilistically Checkable Debates [chapter]

Andrew Drucker
2011 Lecture Notes in Computer Science  
This yields a much tighter connection between the time complexity of natural PSPACE-complete problems and the time complexity of their approximation versions.  ...  2 s + log 2 (polylog(s)) bits of randomness.  ...  This yields much tighter conditional hardness statements for SAT: from an i.o.-lower bound T (n) = n ω(1) on the runtime of algorithms for SAT, we get an i.o.  ... 
doi:10.1007/978-3-642-22935-0_44 fatcat:rgiyvxrrgfa5dgwsuzz4en67r4

Page 7 of Michigan Farmer Vol. 19, Issue 41 [page]

1888 Michigan Farmer  
So Nasmyth resolved to have a match between his steam-hammer and the ordinary pile-driver. Two im- mense logs were selected, and the two ma chines began work at the same moment.  ...  He sat on a Lafayette square bench, says the Washington Critic, a wooden tooth-pick held meditatively between his teeth, the picture of a club-man who had dined well.  ... 

Uncle Bud Long; The Birth of a Kentucky Folk Legend

Richard Sweterlitsch, Kenneth W. Clarke
1978 Journal of American Folklore  
I am grateful to Western Kentucky University for the sabbatical leave which gave me time for this and other interesting projects. I also wish to thank Harold Rigsby for preparing the illustrations.  ...  She had her basket things in the shade of a chestnut oak between the house and the barn. There she sat on an old chopping block with its top smoothed and rounded off by countless ax blows.  ...  FoRMULA Folklore generally, be it in the form of riddles, proverbs, tales, songs, or beliefs, is characterized by formulae.  ... 
doi:10.2307/539591 fatcat:dowgl3zsqzhhdh3ahmrdzl762q

An Algorithmic Theory of Integer Programming [article]

Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn
2022 arXiv   pre-print
In particular, integer programming is fixed-parameter tractable parameterized by a and d, and is solvable in polynomial time for every fixed a and d.  ...  theorems and a new proximity-scaling algorithm, the notion of a reduced objective function, and others.  ...  Acknowledgments References ACKNOWLEDGMENTS Eisenbrand, Hunkenschröder, and Klein were supported by the Swiss National Science Foundation (SNSF) within the project Convexity, geometry of numbers, and  ... 
arXiv:1904.01361v3 fatcat:5jihvj5fvfbgthqid5o7ulcsrm

No-Regret Exploration in Goal-Oriented Reinforcement Learning [article]

Jean Tarbouriech, Evrard Garcelon, Michal Valko, Matteo Pirotta, Alessandro Lazaric
2020 arXiv   pre-print
and SSP-diameter D, defined as the smallest expected hitting time from any starting state to the goal.  ...  ., fixed-horizon and infinite-horizon) or making the restrictive loop-free SSP assumption (i.e., no state can be visited twice during an episode).  ...  p(·|s, a) ∈ B n (s, a)).Let us fix a tuple (s, a) ∈ S × A and define for all n ≥ 0 n (s, a) := 2 log((2 S − 2)5SA(n + ) 2 /δ) n + , kK (s k,h , π k (s k,h )) (s, a) ≤ 2 SAT K,1 .  ... 
arXiv:1912.03517v3 fatcat:us4tuyaggfe6jemd5v6yccbknm

Solving scheduling problems from high-level models

Jean-Noël Monette
2010 4OR  
The two main types of constraints are precedences between activities, and the availability of finite resources.  ...  But the difficulty lies also in the modeling of the problems, and the mapping between high-level, declarative models and low-level, procedural search techniques.  ...  Finally, [Wol05] extends this idea proposing tighter bounds with an algorithm running in O(N 3 ) We present an alternative way to use the position of the tasks based on the idea of shaving.  ... 
doi:10.1007/s10288-010-0143-7 fatcat:xl2o2skrdzcjroge7ymc4rnxlm

Dagstuhl Reports, Volume 6, Issue 9, September 2016, Complete Issue [article]

2017
Special thanks go to the Schloss Dagstuhl team for its extremely friendly support during the preparation phase and for the warm welcome at Schloss Dagstuhl. -SAT and Interactions  ...  We also derive a tight estimation of security for (Ring-)LWE and NTRU assumptions. when q = 2 Ω( √ n log log n) .  ...  The talk also presents some new work, exposing similarities between the two currently disparate fields of QBF dependency schemes and dependency quantified Boolean formulas (DQBF).  ... 
doi:10.4230/dagrep.6.9 fatcat:eaxdsekvnrhuromxdk635sg5ai

THE DEVELOPMENT OF KNOWLEDGE AND INFORMATION NETWORKS IN TOURISM

GHEORGHE AXINTE
2009 Annals of the University of Petrosani: Economics  
of distribution channels used by tourism industry and redesigning all processes connected to this industry and last but not least, influencing the suppliers with touristic packages, destinations and stakeholders  ...  The E-tourism is joining same of the fastest growing technologies such as the communications and information technology the hospitality industry and management, the marketing and the strategic planning  ...  6 1 / 1 5 4 4 2 3 2 } { log ) log ( log β β β λ β β γ λ γ ⎥ ⎥ ⎦ ⎤ ⎢ ⎢ ⎣ ⎡ + − + − + = + 8 7 1 5 6 2 1 3 2 log ) / ( log ) log ( log 6 β β β γ λ λ γ β p D r P Q K D K D (3) ⎥ ⎥ ⎦ ⎤ ⎢ ⎢ ⎣ ⎡ + + + + − = Q  ... 
doaj:35870632ca914ce9988c84bf1a9b3a8c fatcat:3yygkxgknjh3de7tbbonwcntou

Mud map: Australian women's experimental writing

MTC Cronin, Jill Martindale Farrar, joanne burns, Jo Gardiner, Loma Bridge, Carolyn van Langenberg, Jenna Sten, Pam Brown, Sal Brereton, Sarah Holland-Batt, Nour Dados, Tiffany Hambley (+21 others)
2013 Text: Journal of the Australian Association of Writing Programs  
and balancing on what will not hold us ...  ...  Becoming more and more naked. Necessary. Unnecessary. Nothing changes it if it is.  ...  logs aside to get at the ant-rich ground.  ... 
doi:10.52086/001c.28893 fatcat:hnauom2cvzej3ocogwmys7rs3a

Numerical study of the microscopic structure of jammed systems: from inferring their dynamics to finite size scaling [article]

Díaz Hernández Rojas, Rafael
2021 arXiv   pre-print
In particular, I focused on microscopic properties of jammed packings, such as the distribution of contact forces and interparticle gaps, as well as the single particle dynamics that occur near the jamming  ...  These two states are connected through (i) the typical distance (∆ r ) between the reference configurations at (φ g , p g ) and the target one; and (ii) the typical distance (∆ ) between different states  ...  There is therefore a strong connection between the distribution of forces in bucklers and the particle displacements their floppy modes produce.  ... 
arXiv:2107.03939v1 fatcat:htqjs2ifwfdyfjggzhlcqcoubq
« Previous Showing results 1 — 15 out of 97 results