Search Results - Mathematics of computing Discrete mathematics Combinatorics

On the Expressive Power of Homomorphism Counts by Atserias, Albert, Kolaitis, Phokion G., Wu, Wei-Lin

“…A classical result by Lovász asserts that two graphs G and H are isomorphic if and only if they have the same left profile, that is, for every graph F, the…”
Get full text

Universal Skolem Sets by Luca, Florian, Ouaknine, Joel, Worrell, James

“…It is a longstanding open problem whether there is an algorithm to decide the Skolem Problem for linear recurrence sequences, namely whether a given such…”
Get full text

Arjun: An Efficient Independent Support Computation Technique and its Applications to Counting and Sampling by Soos, Mate, Meel, Kuldeep S.

“…Given a Boolean formula φ over the set of variables X and a projection set \mathcal{P} \subseteq X, then if \mathcal{I} \subseteq \mathcal{P} is independent…”
Get full text

Constraint Satisfaction Problems over Finite Structures by Barto, Libor, DeMeo, William, Mottet, Antoine

“…We initiate a systematic study of the computational complexity of the Constraint Satisfaction Problem (CSP) over finite structures that may contain both…”
Get full text

Optimal Join Algorithms Meet Top- k by Tziavelis, Nikolaos, Gatterbauer, Wolfgang, Riedewald, Mirek

“…have been studied intensively in the database community and they are an important means to reduce query cost when only the "best" or "most interesting" results…”
Get more information

Approximate SMT Counting Beyond Discrete Domains by Shaw, Arijit, Meel, Kuldeep S.

“…Satisfiability Modulo Theory (SMT) solvers have advanced automated reasoning, solving complex formulas across discrete and continuous domains…”
Get full text

Linear Algebra Approach for Directed Triad Counting and Enumeration by Kerdcharoen, Yuttapichai, Sridhar, Upasana, Sangpetch, Orathai, Low, Tze Meng

“…Triangle counting and enumeration are commonly used in real-world applications on directed graphs. However, the performance of triangle counting algorithms is…”
Get full text

A Comparison on Constrain Encoding Methods for Quantum Approximate Optimization Algorithm by Liu, Yiwen, Jiao, Qingyue, Shi, Yiyu, Wan, Ke, Guo, Shangjie

“…The Quantum Approximate Optimization Algorithm (QAOA) represents a significant opportunity for practical quantum computing applications, particularly in the era before error correction is fully realized…”
Get full text

Inapproximability of Unique Games in Fixed-Point Logic with Counting by Tucker-Foltz, Jamie

“…We study the extent to which it is possible to approximate the optimal value of a Unique Games instance in Fixed-Point Logic with Counting (FPC). We prove two…”
Get full text

A Unified Framework to Estimate Global and Local Graphlet Counts for Streaming Graphs by Chen, Xiaowei, Lui, John C.S.

“… Graphlets have numerous applications ranging from biology to network science. Computing graphlet counts for "dynamic graphs" is highly challenging due to the streaming…”
Get full text

Finding Spatial Clusters Susceptible to Epidemic Outbreaks due to Undervaccination by Cadena, Jose, Marathe, Achla, Vullikanti, Anil

“…Geographical clusters of undervaccinated populations have emerged in various parts of the United States in recent years. Public health response involves…”
Get full text

AMUSE: a minimally-unsatisfiable subformula extractor by Oh, Yoonna, Mneimneh, Maher N., Andraus, Zaher S., Sakallah, Karem A., Markov, Igor L.

“…This paper describes a new algorithm for extracting unsatisfiable subformulas from a given unsatisfiable CNF formula. Such unsatisfiable "cores" can be very…”
Get full text

Efficient path conditions in dependence graphs by Robschink, Torsten, Snelting, Gregor

“… points.In this contribution we show how to make path conditions work for large programs. Aggressive engineering, based on interval analysis and BDDs, is shown to overcome the potential combinatoric explosion…”
Get full text

Possibility Degree Method for Ranking Intuitionistic Fuzzy Numbers by Cui-Ping Wei, Xijin Tang

“…In this paper, we study the method of ranking intuitionistic fuzzy numbers. Firstly a possibility degree formula is defined to compare two intuitionistic fuzzy…”
Get full text

Tracking multiple targets using binary proximity sensors by Singh, Jaspreet, Madhow, Upamanyu, Kumar, Rajesh, Suri, Subhash, Cagley, Richard

“…Recent work has shown that, despite the minimal information provided by a binary proximity sensor, a network of such sensors can provide remarkably good target…”
Get full text

Effective bounding techniques for solving unate and binate covering problems by Li, Xiao Yu, Stallmann, Matthias F., Brglez, Franc

“…Covering problems arise in many areas of electronic design automation such as logic minimization and technology mapping. An exact solution can critically…”
Get full text

Revisiting Hamiltonian Decomposition of the Hypercube by Okuda, K., Song, S. W.

“…A hypercube or binary n-cube is an interconnection network very suitable for implementing computing elements…”
Get full text

Preface

Get full text

Session details: Military applications: military acquistion and employment modeling

Get full text

Preface

Get full text