Suchergebnisse - Mathematics of computing Discrete mathematics Combinatorics

On the Expressive Power of Homomorphism Counts von 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 …”
Volltext

Universal Skolem Sets von 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 …”
Volltext

Arjun: An Efficient Independent Support Computation Technique and its Applications to Counting and Sampling von 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 …”
Volltext

Constraint Satisfaction Problems over Finite Structures von 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 …”
Volltext

Optimal Join Algorithms Meet Top- k von 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 …”
Weitere Angaben

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

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

Linear Algebra Approach for Directed Triad Counting and Enumeration von 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 …”
Volltext

A Comparison on Constrain Encoding Methods for Quantum Approximate Optimization Algorithm von 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 …”
Volltext

Inapproximability of Unique Games in Fixed-Point Logic with Counting von 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 …”
Volltext

A Unified Framework to Estimate Global and Local Graphlet Counts for Streaming Graphs von 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 …”
Volltext

Finding Spatial Clusters Susceptible to Epidemic Outbreaks due to Undervaccination von 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 …”
Volltext

AMUSE: a minimally-unsatisfiable subformula extractor von 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 …”
Volltext

Efficient path conditions in dependence graphs von 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 …”
Volltext

Possibility Degree Method for Ranking Intuitionistic Fuzzy Numbers von 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 …”
Volltext

Tracking multiple targets using binary proximity sensors von 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 …”
Volltext

Effective bounding techniques for solving unate and binate covering problems von 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 …”
Volltext

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

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

Preface

Volltext

Session details: Military applications: military acquistion and employment modeling

Volltext

Preface

Volltext