Results 31 to 40 of about 47,064 (164)
Representing Small Ordinals by Finite Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 It is known that an ordinal is the order type of the lexicographic ordering of a regular language if and only if it is less than omega^omega. We design a polynomial time algorithm that constructs, for each well-ordered regular language L with respect to ...
Zoltan Ésik
doaj +1 more source
A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits
npj Quantum Information, 2022 We investigate the problem of synthesizing T-depth optimal quantum circuits for exactly implementable unitaries over the Clifford+T gate set. We construct a subset, $${{\mathbb{V}}}_{n}$$ V n , of T-depth 1 unitaries.
Vlad Gheorghiu +2 more
doaj +1 more source
Polynomial-time algorithms for permutation groups [PDF]
21st Annual Symposium on Foundations of Computer Science (sfcs 1980), 1980 A permutation group on n letters may always be represented by a small set of generators, even though its size may be exponential in n. We show that it is practical to use such a representation since many problems such as membership testing, equality testing, and inclusion testing are decidable in polynomial time.
Merrick Furst +2 more
openaire +1 more source
A subexponential-time, polynomial quantum space algorithm for inverting the CM group action
Journal of Mathematical Cryptology, 2020 We present a quantum algorithm which computes group action inverses of the complex multiplication group action on isogenous ordinary elliptic curves, using subexponential time, but only polynomial quantum space.
Jao David +3 more
doaj +1 more source
Safe Approximation—An Efficient Solution for a Hard Routing Problem
Algorithms, 2021 The Disjoint Connecting Paths problem and its capacitated generalization, called Unsplittable Flow problem, play an important role in practical applications such as communication network design and routing. These tasks are NP-hard in general, but various
András Faragó, Zohre R. Mojaveri
doaj +1 more source
Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials [PDF]
SIAM Journal on Computing, 2017 In this paper we show a new way of constructing deterministic polynomial-time approximation algorithms for computing complex-valued evaluations of a large class of graph polynomials on bounded degree graphs. In particular, our approach works for the Tutte polynomial and independence polynomial, as well as partition functions of complex-valued spin and ...
Patel, V., Regts, G.
openaire +7 more sources
Polynomial Time Algorithm for Shortest Paths in Interval Temporal Graphs
AlgorithmsWe develop a polynomial time algorithm for the single-source all destinations shortest paths problem for interval temporal graphs (ITGs). While a polynomial time algorithm for this problem is known for contact sequence temporal graphs (CSGs), no such ...
Anuj Jain, Sartaj Sahni
doaj +1 more source
A Simple Algorithm for Consistent Query Answering under Primary Keys [PDF]
Logical Methods in Computer ScienceWe consider the dichotomy conjecture for consistent query answering under primary key constraints. It states that, for every fixed Boolean conjunctive query q, testing whether q is certain (i.e.
Diego Figueira +3 more
doaj +1 more source
On Optimistic and Pessimistic Bilevel Optimization Models for Demand Response Management
Energies, 2021 This paper investigates bilevel optimization models for demand response management, and highlights the often overlooked consequences of a common modeling assumption in the field.
Tamás Kis +2 more
doaj +1 more source
Algorithms for Molecular Biology, 2009 Background The ability to monitor the change in expression patterns over time, and to observe the emergence of coherent temporal responses using gene expression time series, obtained from microarray experiments, is critical to advance our understanding ...
Madeira Sara C, Oliveira Arlindo L
doaj +1 more source