Stasys - PDFSEARCH.IO - Document Search Engine

Stasys
Results: 33

#	Item
11	ENTROPY OF OPERATORS OR WHY MATRIX MULTIPLICATION IS HARD FOR DEPTH-TWO CIRCUITS STASYS JUKNA Abstract. We consider unbounded fanin depth-2 circuits with arbitrary boolean functions as gates. We define the entropy of an Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2009-01-13 11:44:18 Information theory Randomness Philosophy of thermal and statistical physics Quantum information science Entropy Circuit Boolean circuit Fourier transform Communication complexity Theoretical computer science Applied mathematics Computational complexity theory
12	Clique Problem, Cutting Plane Proofs and Communication Complexity✩ Stasys Jukna Institute of Computer Science, University of Frankfurt, Frankfurt a.M., Germany Institute of Mathematics and Informatics, Vilnius Universi Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2012-06-27 11:58:26 NP-complete problems Clique Matching Maximal independent set Independent set Circuit complexity Path decomposition Bipartite dimension Graph theory Theoretical computer science Mathematics
13	Limitations of Incremental Dynamic Programming Stasys Jukna Abstract We consider so-called “incremental” dynamic programming algorithms, and are interested in the number of subproblems produced by them. The classical Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2013-04-23 13:36:27 Operations research Dynamic programming NP-complete problems Mathematical optimization Combinatorics Algorithm Greedy algorithm Knapsack problem Longest increasing subsequence Mathematics Theoretical computer science Applied mathematics
14	Lower Bounds for Monotone Counting Circuits Stasys Jukna1,2 Institute of Computer Science, Goethe University, Frankfurt am Main, Germany Abstract A {+, ×}-circuit counts a given multivariate polynomial f , if its values Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2015-01-31 16:25:52 Abstract algebra Homogeneous polynomial Circuit complexity Arithmetic circuit complexity Tutte polynomial Mathematics Algebra Polynomials
15	Lower Bounds for Tropical Circuits and Dynamic Programs∗ Stasys Jukna University of Frankfurt, Institute of Computer Science, Germany Vilnius University, Institute of Mathematics and Informatics, Vilnius, Lithuania juk Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2015-02-05 11:02:38 Algebraic structures Algebraic geometry Ring theory Polynomials Circuit complexity Arithmetic circuit complexity Semiring Monomial Tropical geometry Algebra Mathematics Abstract algebra
16	Leidimo metai: 2012; Institucijoje pareigas užimantys autoriai. I lygio padalinys: 580000 – VU Matematikos ir informatikos institutas; MOKSLINĖS PUBLIKACIJOS MONOGRAFIJOS 1. Jukna, Stasys. Boolean Function Complexity Add to Reading List Source URL: www.mii.lt Language: English - Date: 2015-02-04 10:03:32 Inspec Computational and Mathematical Organization Theory Journal of Mathematical Biology Publishing Academic publishing Mass media
17	Entropy of Operators or Nechiporuk for Depth-2 Circuits Stasys Jukna Institute of Mathematics, Vilnius, Lithuania University of Frankfurt, Germany Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2008-09-21 04:24:11 Entropy Statistical theory Circuit FP Probability and statistics Computer science Applied mathematics Information theory Randomness Theory of computation
18	On the P versus NP intersected with co-NP question in communication complexity Stasys Jukna Abstract Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2007-08-30 03:42:23 Complexity classes Quantum complexity theory Mathematical optimization Models of computation NP Bounded-error probabilistic polynomial P versus NP problem PP Communication complexity Theoretical computer science Computational complexity theory Applied mathematics
19	Review of12 Boolean Function Complexity: Advances and Frontiers by Stasys Jukna Springer, pages, $85.00, HARDCOVER Review by Add to Reading List Source URL: www.thi.informatik.uni-frankfurt.de Language: English - Date: 2013-10-30 13:45:27 Circuit complexity Complexity classes Logic in computer science Switching lemma Circuit Boolean circuit NC AC Decision tree model Theoretical computer science Applied mathematics Computational complexity theory
20	Yet Harder Knapsack ProblemsI Stasys Jukna∗,1 Georg Schnitger University of Frankfurt, Institut of Computer Science, DFrankfurt, Germany. Abstract Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2011-10-21 09:58:40 Computational complexity theory Combinatorial optimization NP-complete problems Cryptography Dynamic programming Knapsack problem Branch and bound Optimization problem Backtracking Operations research Theoretical computer science Applied mathematics

UPDATE